./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:42:41,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:42:41,886 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:42:41,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:42:41,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:42:41,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:42:41,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:42:41,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:42:41,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:42:41,925 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:42:41,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:42:41,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:42:41,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:42:41,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:42:41,928 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:42:41,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:42:41,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:42:41,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:42:41,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:42:41,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:42:41,932 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:42:41,933 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:42:41,933 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:42:41,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:42:41,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:42:41,935 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:42:41,935 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:42:41,936 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:42:41,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:42:41,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:42:41,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:42:41,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:42:41,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:41,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:42:41,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:42:41,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:42:41,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:42:41,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:42:41,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:42:41,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:42:41,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:42:41,941 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/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_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2023-11-29 06:42:42,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:42:42,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:42:42,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:42:42,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:42:42,246 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:42:42,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-11-29 06:42:45,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:42:45,380 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:42:45,381 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-11-29 06:42:45,398 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/data/7a2ada3cc/ab52d24b121e4f67ac2fd4e52483bd2b/FLAG9b8c02622 [2023-11-29 06:42:45,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/data/7a2ada3cc/ab52d24b121e4f67ac2fd4e52483bd2b [2023-11-29 06:42:45,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:42:45,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:42:45,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:45,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:42:45,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:42:45,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35abdb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45, skipping insertion in model container [2023-11-29 06:42:45,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,476 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:42:45,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:45,800 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:42:45,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:45,871 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:42:45,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45 WrapperNode [2023-11-29 06:42:45,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:45,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:45,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:42:45,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:42:45,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,922 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-29 06:42:45,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:45,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:42:45,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:42:45,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:42:45,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,965 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-11-29 06:42:45,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:45,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:42:45,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:42:45,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:42:45,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:42:45,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (1/1) ... [2023-11-29 06:42:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:46,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:46,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:42:46,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:42:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:42:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:42:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:42:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:42:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 06:42:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 06:42:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:42:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:42:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:42:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:42:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:42:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:42:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:42:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:42:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:42:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:42:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:42:46,229 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:42:46,231 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:42:46,524 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:42:46,590 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:42:46,590 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 06:42:46,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:46 BoogieIcfgContainer [2023-11-29 06:42:46,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:42:46,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:42:46,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:42:46,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:42:46,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:42:45" (1/3) ... [2023-11-29 06:42:46,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ec80a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:46, skipping insertion in model container [2023-11-29 06:42:46,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:45" (2/3) ... [2023-11-29 06:42:46,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ec80a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:46, skipping insertion in model container [2023-11-29 06:42:46,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:46" (3/3) ... [2023-11-29 06:42:46,604 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2023-11-29 06:42:46,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:42:46,627 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-29 06:42:46,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:42:46,687 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4d538d75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:42:46,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2023-11-29 06:42:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 37 states have (on average 2.189189189189189) internal successors, (81), 65 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:42:46,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:46,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:42:46,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:46,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash 209499439, now seen corresponding path program 1 times [2023-11-29 06:42:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529788523] [2023-11-29 06:42:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529788523] [2023-11-29 06:42:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529788523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:46,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:42:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238820892] [2023-11-29 06:42:46,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:46,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,026 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 2.189189189189189) internal successors, (81), 65 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 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) [2023-11-29 06:42:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,127 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2023-11-29 06:42:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:47,131 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 [2023-11-29 06:42:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,140 INFO L225 Difference]: With dead ends: 66 [2023-11-29 06:42:47,140 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 06:42:47,142 INFO L412 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 [2023-11-29 06:42:47,145 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 06:42:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-29 06:42:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2023-11-29 06:42:47,195 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 5 [2023-11-29 06:42:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,196 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2023-11-29 06:42:47,196 INFO L496 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) [2023-11-29 06:42:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2023-11-29 06:42:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:42:47,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:42:47,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:42:47,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:47,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash 209499440, now seen corresponding path program 1 times [2023-11-29 06:42:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018705983] [2023-11-29 06:42:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018705983] [2023-11-29 06:42:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018705983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:42:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193307894] [2023-11-29 06:42:47,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,341 INFO L87 Difference]: Start difference. First operand 64 states and 71 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) [2023-11-29 06:42:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,413 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2023-11-29 06:42:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:47,413 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 [2023-11-29 06:42:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,415 INFO L225 Difference]: With dead ends: 62 [2023-11-29 06:42:47,415 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:42:47,416 INFO L412 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 [2023-11-29 06:42:47,418 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:42:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 06:42:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2023-11-29 06:42:47,429 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 5 [2023-11-29 06:42:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,429 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2023-11-29 06:42:47,429 INFO L496 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) [2023-11-29 06:42:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2023-11-29 06:42:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:42:47,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:47,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:42:47,431 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:47,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1748640650, now seen corresponding path program 1 times [2023-11-29 06:42:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420388776] [2023-11-29 06:42:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:42:47,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420388776] [2023-11-29 06:42:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420388776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:42:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027160208] [2023-11-29 06:42:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:42:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:42:47,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:47,574 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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) [2023-11-29 06:42:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,678 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2023-11-29 06:42:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:42:47,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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 [2023-11-29 06:42:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,680 INFO L225 Difference]: With dead ends: 68 [2023-11-29 06:42:47,680 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 06:42:47,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:47,682 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 138 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 06:42:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-11-29 06:42:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 59 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2023-11-29 06:42:47,694 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 10 [2023-11-29 06:42:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,694 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2023-11-29 06:42:47,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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) [2023-11-29 06:42:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2023-11-29 06:42:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 06:42:47,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:47,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:42:47,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:47,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash 420391556, now seen corresponding path program 1 times [2023-11-29 06:42:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605036630] [2023-11-29 06:42:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:42:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605036630] [2023-11-29 06:42:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605036630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085070145] [2023-11-29 06:42:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:42:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:42:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:47,934 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-11-29 06:42:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:48,148 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2023-11-29 06:42:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:42:48,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 17 [2023-11-29 06:42:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:48,152 INFO L225 Difference]: With dead ends: 62 [2023-11-29 06:42:48,152 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:42:48,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:42:48,154 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:48,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 227 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:42:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 06:42:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2023-11-29 06:42:48,162 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 17 [2023-11-29 06:42:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:48,163 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2023-11-29 06:42:48,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-11-29 06:42:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2023-11-29 06:42:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 06:42:48,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:48,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:48,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:42:48,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:48,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 420391557, now seen corresponding path program 1 times [2023-11-29 06:42:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314729782] [2023-11-29 06:42:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314729782] [2023-11-29 06:42:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314729782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:48,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:48,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:48,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744418203] [2023-11-29 06:42:48,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:48,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:42:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:42:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:48,575 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-11-29 06:42:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:48,747 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2023-11-29 06:42:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:42:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2023-11-29 06:42:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:48,749 INFO L225 Difference]: With dead ends: 61 [2023-11-29 06:42:48,749 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 06:42:48,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:42:48,751 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:48,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 247 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 06:42:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 06:42:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-11-29 06:42:48,758 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 17 [2023-11-29 06:42:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:48,759 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-11-29 06:42:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-11-29 06:42:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-11-29 06:42:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 06:42:48,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:48,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:48,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:42:48,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:48,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 269529954, now seen corresponding path program 1 times [2023-11-29 06:42:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320073750] [2023-11-29 06:42:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:42:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320073750] [2023-11-29 06:42:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320073750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123247561] [2023-11-29 06:42:49,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:49,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:49,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:49,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:42:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 06:42:49,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:49,342 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 [2023-11-29 06:42:49,455 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:42:49,455 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 [2023-11-29 06:42:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:49,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123247561] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:49,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:42:49,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-29 06:42:49,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245108236] [2023-11-29 06:42:49,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:49,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 06:42:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 06:42:49,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:42:49,882 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:42:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:50,249 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2023-11-29 06:42:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:42:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-29 06:42:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:50,251 INFO L225 Difference]: With dead ends: 60 [2023-11-29 06:42:50,251 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 06:42:50,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:42:50,253 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:50,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 489 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:42:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 06:42:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 06:42:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.75) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2023-11-29 06:42:50,260 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 19 [2023-11-29 06:42:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:50,260 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2023-11-29 06:42:50,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:42:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2023-11-29 06:42:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 06:42:50,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:50,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:50,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:42:50,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:50,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:50,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash 269529955, now seen corresponding path program 1 times [2023-11-29 06:42:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201722596] [2023-11-29 06:42:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201722596] [2023-11-29 06:42:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201722596] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782492631] [2023-11-29 06:42:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:51,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:51,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:51,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:42:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 06:42:51,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:51,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:42:51,152 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 [2023-11-29 06:42:51,287 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-29 06:42:51,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:51,322 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 [2023-11-29 06:42:51,333 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:42:51,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 06:42:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 06:42:51,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:51,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782492631] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:51,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:42:51,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-11-29 06:42:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861946624] [2023-11-29 06:42:51,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:51,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:42:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:51,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:42:51,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2023-11-29 06:42:51,497 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:42:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:51,758 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-11-29 06:42:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:42:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-29 06:42:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:51,760 INFO L225 Difference]: With dead ends: 60 [2023-11-29 06:42:51,760 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 06:42:51,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2023-11-29 06:42:51,762 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:51,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2023-11-29 06:42:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 06:42:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-11-29 06:42:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 55 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-11-29 06:42:51,768 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 19 [2023-11-29 06:42:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:51,768 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-11-29 06:42:51,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:42:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-11-29 06:42:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 06:42:51,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:51,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:51,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:42:51,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:51,975 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:51,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:51,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091990, now seen corresponding path program 1 times [2023-11-29 06:42:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270454133] [2023-11-29 06:42:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 06:42:52,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:52,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270454133] [2023-11-29 06:42:52,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270454133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:52,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:52,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:42:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805940766] [2023-11-29 06:42:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:52,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:42:52,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:42:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:42:52,175 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2023-11-29 06:42:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:52,391 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-11-29 06:42:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:42:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 22 [2023-11-29 06:42:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:52,392 INFO L225 Difference]: With dead ends: 84 [2023-11-29 06:42:52,393 INFO L226 Difference]: Without dead ends: 84 [2023-11-29 06:42:52,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:42:52,394 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 60 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:52,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-29 06:42:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2023-11-29 06:42:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 58 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-11-29 06:42:52,400 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 22 [2023-11-29 06:42:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:52,400 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-11-29 06:42:52,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2023-11-29 06:42:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-11-29 06:42:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 06:42:52,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:52,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:52,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:42:52,402 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:52,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2017091989, now seen corresponding path program 1 times [2023-11-29 06:42:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:52,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252161082] [2023-11-29 06:42:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:52,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252161082] [2023-11-29 06:42:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252161082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:42:52,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134400022] [2023-11-29 06:42:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:52,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:42:52,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:42:52,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:42:52,695 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-11-29 06:42:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:52,911 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-11-29 06:42:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:42:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 22 [2023-11-29 06:42:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:52,913 INFO L225 Difference]: With dead ends: 63 [2023-11-29 06:42:52,913 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 06:42:52,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:42:52,913 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 57 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:52,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 304 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 06:42:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-11-29 06:42:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-11-29 06:42:52,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 22 [2023-11-29 06:42:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:52,919 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-11-29 06:42:52,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2023-11-29 06:42:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-11-29 06:42:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 06:42:52,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:52,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:52,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:42:52,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:52,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1396384217, now seen corresponding path program 1 times [2023-11-29 06:42:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214728733] [2023-11-29 06:42:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:42:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214728733] [2023-11-29 06:42:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214728733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:42:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654970167] [2023-11-29 06:42:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:53,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:42:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:42:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:53,023 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:42:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:53,104 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2023-11-29 06:42:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:53,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-29 06:42:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:53,106 INFO L225 Difference]: With dead ends: 85 [2023-11-29 06:42:53,106 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 06:42:53,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:53,107 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 92 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:53,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 121 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 06:42:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2023-11-29 06:42:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-11-29 06:42:53,113 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 24 [2023-11-29 06:42:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:53,113 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-11-29 06:42:53,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:42:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-11-29 06:42:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 06:42:53,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:53,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:53,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:42:53,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:53,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1394965995, now seen corresponding path program 1 times [2023-11-29 06:42:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622264339] [2023-11-29 06:42:53,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:42:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622264339] [2023-11-29 06:42:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622264339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:42:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978003166] [2023-11-29 06:42:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:53,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:42:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:42:53,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:53,200 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:42:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:53,286 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-29 06:42:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:53,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-29 06:42:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:53,288 INFO L225 Difference]: With dead ends: 77 [2023-11-29 06:42:53,288 INFO L226 Difference]: Without dead ends: 77 [2023-11-29 06:42:53,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:53,289 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:53,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 173 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-29 06:42:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-11-29 06:42:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2023-11-29 06:42:53,294 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 24 [2023-11-29 06:42:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:53,295 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2023-11-29 06:42:53,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:42:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2023-11-29 06:42:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:42:53,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:53,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:53,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:42:53,297 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:53,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -968235333, now seen corresponding path program 1 times [2023-11-29 06:42:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201292057] [2023-11-29 06:42:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:42:53,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:53,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201292057] [2023-11-29 06:42:53,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201292057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:53,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:53,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:42:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178104903] [2023-11-29 06:42:53,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:53,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:42:53,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:42:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:53,389 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:42:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:53,476 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2023-11-29 06:42:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-11-29 06:42:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:53,477 INFO L225 Difference]: With dead ends: 74 [2023-11-29 06:42:53,477 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 06:42:53,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:53,478 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:53,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 173 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 06:42:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2023-11-29 06:42:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.627906976744186) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2023-11-29 06:42:53,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 27 [2023-11-29 06:42:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:53,483 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2023-11-29 06:42:53,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:42:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2023-11-29 06:42:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:42:53,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:53,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:42:53,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:53,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -968235388, now seen corresponding path program 1 times [2023-11-29 06:42:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564577390] [2023-11-29 06:42:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:42:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564577390] [2023-11-29 06:42:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564577390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:53,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:53,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:42:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828088464] [2023-11-29 06:42:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:53,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:42:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:53,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:42:53,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:42:53,655 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-11-29 06:42:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:53,902 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2023-11-29 06:42:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:42:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 27 [2023-11-29 06:42:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:53,903 INFO L225 Difference]: With dead ends: 91 [2023-11-29 06:42:53,904 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 06:42:53,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:42:53,905 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:53,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 269 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 06:42:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2023-11-29 06:42:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 65 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2023-11-29 06:42:53,909 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 27 [2023-11-29 06:42:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:53,910 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2023-11-29 06:42:53,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2023-11-29 06:42:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2023-11-29 06:42:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:42:53,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:53,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:53,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:42:53,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:53,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -968235387, now seen corresponding path program 1 times [2023-11-29 06:42:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046185039] [2023-11-29 06:42:53,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:53,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:42:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046185039] [2023-11-29 06:42:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046185039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587201435] [2023-11-29 06:42:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:54,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:54,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 06:42:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:42:54,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:42:54,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:42:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587201435] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:42:54,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:42:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-29 06:42:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552681065] [2023-11-29 06:42:54,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:54,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:42:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:54,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:42:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:42:54,353 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:42:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:54,476 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-11-29 06:42:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:42:54,476 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-11-29 06:42:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:54,477 INFO L225 Difference]: With dead ends: 78 [2023-11-29 06:42:54,478 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 06:42:54,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:42:54,479 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:54,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 160 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 06:42:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2023-11-29 06:42:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 70 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:42:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2023-11-29 06:42:54,483 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 27 [2023-11-29 06:42:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:54,483 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2023-11-29 06:42:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:42:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2023-11-29 06:42:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:42:54,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:54,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:54,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 06:42:54,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 06:42:54,689 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:54,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -966817111, now seen corresponding path program 1 times [2023-11-29 06:42:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683520163] [2023-11-29 06:42:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683520163] [2023-11-29 06:42:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683520163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859354211] [2023-11-29 06:42:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:55,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:55,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:55,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:55,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 06:42:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 06:42:55,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:55,668 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 [2023-11-29 06:42:55,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:42:55,785 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 [2023-11-29 06:42:55,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:42:55,916 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:42:55,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 06:42:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:56,033 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 17 [2023-11-29 06:42:56,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:42:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:56,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:42:56,533 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-29 06:42:56,533 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 19 treesize of output 18 [2023-11-29 06:42:56,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859354211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:56,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:42:56,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2023-11-29 06:42:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099495558] [2023-11-29 06:42:56,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:42:56,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:42:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:42:56,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:42:56,677 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:42:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:57,304 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2023-11-29 06:42:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:42:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 06:42:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:57,306 INFO L225 Difference]: With dead ends: 145 [2023-11-29 06:42:57,306 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 06:42:57,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 06:42:57,308 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 169 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:57,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 617 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:42:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 06:42:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2023-11-29 06:42:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 85 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:42:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2023-11-29 06:42:57,315 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 27 [2023-11-29 06:42:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:57,316 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2023-11-29 06:42:57,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:42:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2023-11-29 06:42:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 06:42:57,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:57,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:57,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 06:42:57,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 06:42:57,525 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:42:57,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash -966817110, now seen corresponding path program 1 times [2023-11-29 06:42:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997186023] [2023-11-29 06:42:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:42:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:42:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:58,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:58,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997186023] [2023-11-29 06:42:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997186023] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:42:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925229603] [2023-11-29 06:42:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:58,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:42:58,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:58,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:42:58,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:42:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-29 06:42:58,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:58,774 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 [2023-11-29 06:42:59,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:42:59,097 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 [2023-11-29 06:42:59,104 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 16 treesize of output 11 [2023-11-29 06:42:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:42:59,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:42:59,294 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:42:59,294 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 56 treesize of output 51 [2023-11-29 06:42:59,299 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 39 treesize of output 24 [2023-11-29 06:42:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,438 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 43 treesize of output 23 [2023-11-29 06:42:59,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-11-29 06:42:59,524 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 31 treesize of output 19 [2023-11-29 06:42:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-29 06:42:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:42:59,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:00,126 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1140 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-29 06:43:00,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:00,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-11-29 06:43:00,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-11-29 06:43:00,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:00,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-11-29 06:43:00,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:00,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-11-29 06:43:00,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:00,183 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 27 treesize of output 19 [2023-11-29 06:43:00,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:00,188 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 20 treesize of output 12 [2023-11-29 06:43:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925229603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:00,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2023-11-29 06:43:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97218560] [2023-11-29 06:43:00,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:00,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 06:43:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 06:43:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1375, Unknown=1, NotChecked=74, Total=1560 [2023-11-29 06:43:00,413 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:43:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:01,352 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2023-11-29 06:43:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:43:01,352 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-11-29 06:43:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:01,353 INFO L225 Difference]: With dead ends: 152 [2023-11-29 06:43:01,353 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 06:43:01,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=159, Invalid=1736, Unknown=1, NotChecked=84, Total=1980 [2023-11-29 06:43:01,355 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 125 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:01,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 854 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:43:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 06:43:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 95. [2023-11-29 06:43:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 90 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) [2023-11-29 06:43:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2023-11-29 06:43:01,361 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 27 [2023-11-29 06:43:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:01,361 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2023-11-29 06:43:01,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:43:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2023-11-29 06:43:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 06:43:01,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:01,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:01,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:43:01,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 06:43:01,565 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:01,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1398121836, now seen corresponding path program 2 times [2023-11-29 06:43:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994748742] [2023-11-29 06:43:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:43:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994748742] [2023-11-29 06:43:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994748742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88566453] [2023-11-29 06:43:01,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:43:01,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:01,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:01,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:01,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:43:01,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:43:01,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:43:01,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:01,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:43:01,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:43:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88566453] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:02,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:02,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2023-11-29 06:43:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622087577] [2023-11-29 06:43:02,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:02,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:43:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:43:02,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:02,036 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:43:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:02,198 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2023-11-29 06:43:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:43:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-11-29 06:43:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:02,200 INFO L225 Difference]: With dead ends: 95 [2023-11-29 06:43:02,200 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 06:43:02,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:43:02,201 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 89 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:02,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 201 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 06:43:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2023-11-29 06:43:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 86 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:43:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2023-11-29 06:43:02,206 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 29 [2023-11-29 06:43:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:02,207 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2023-11-29 06:43:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:43:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2023-11-29 06:43:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 06:43:02,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:02,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:02,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 06:43:02,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 06:43:02,413 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:02,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2037701263, now seen corresponding path program 2 times [2023-11-29 06:43:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977017901] [2023-11-29 06:43:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:43:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:02,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977017901] [2023-11-29 06:43:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977017901] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:02,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536012052] [2023-11-29 06:43:02,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:43:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:02,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:02,533 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:02,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 06:43:02,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:43:02,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:43:02,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 06:43:02,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:43:02,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:02,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536012052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:02,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:02,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 13 [2023-11-29 06:43:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009086639] [2023-11-29 06:43:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:02,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:43:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:43:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:43:02,907 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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) [2023-11-29 06:43:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:03,122 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2023-11-29 06:43:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:43:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 30 [2023-11-29 06:43:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:03,124 INFO L225 Difference]: With dead ends: 91 [2023-11-29 06:43:03,124 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 06:43:03,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:43:03,125 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 50 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:03,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 276 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:43:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 06:43:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-29 06:43:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.463768115942029) internal successors, (101), 86 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) [2023-11-29 06:43:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2023-11-29 06:43:03,129 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 30 [2023-11-29 06:43:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:03,129 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2023-11-29 06:43:03,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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) [2023-11-29 06:43:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2023-11-29 06:43:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 06:43:03,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:03,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:03,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 06:43:03,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 06:43:03,333 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:03,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -493195830, now seen corresponding path program 3 times [2023-11-29 06:43:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799578558] [2023-11-29 06:43:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:43:03,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:03,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799578558] [2023-11-29 06:43:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799578558] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363014117] [2023-11-29 06:43:03,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:43:03,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:03,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:03,463 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:03,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 06:43:03,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 06:43:03,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:43:03,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:43:03,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:43:03,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363014117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-11-29 06:43:03,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698028794] [2023-11-29 06:43:03,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:03,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:43:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:43:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:43:03,810 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:03,865 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-11-29 06:43:03,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:03,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-29 06:43:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:03,867 INFO L225 Difference]: With dead ends: 90 [2023-11-29 06:43:03,867 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 06:43:03,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:43:03,869 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:03,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 85 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:43:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 06:43:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2023-11-29 06:43:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.4262295081967213) 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) [2023-11-29 06:43:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-11-29 06:43:03,874 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 32 [2023-11-29 06:43:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:03,874 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-11-29 06:43:03,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-11-29 06:43:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 06:43:03,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:03,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:03,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 06:43:04,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:04,076 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:04,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash -87366165, now seen corresponding path program 1 times [2023-11-29 06:43:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657735053] [2023-11-29 06:43:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:04,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:43:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657735053] [2023-11-29 06:43:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657735053] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:04,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18621811] [2023-11-29 06:43:04,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:04,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:04,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:04,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:04,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 06:43:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:04,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:43:04,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:43:04,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 06:43:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18621811] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:04,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:04,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-29 06:43:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476581032] [2023-11-29 06:43:04,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:04,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:43:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:43:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:04,579 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:04,699 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2023-11-29 06:43:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-29 06:43:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:04,700 INFO L225 Difference]: With dead ends: 86 [2023-11-29 06:43:04,701 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 06:43:04,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:04,701 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:04,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 228 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 06:43:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2023-11-29 06:43:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 78 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:43:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-11-29 06:43:04,706 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 33 [2023-11-29 06:43:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:04,706 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-11-29 06:43:04,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-11-29 06:43:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 06:43:04,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:04,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:04,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:04,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:04,909 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:04,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 987158934, now seen corresponding path program 1 times [2023-11-29 06:43:04,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:04,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404745358] [2023-11-29 06:43:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:06,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:43:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404745358] [2023-11-29 06:43:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404745358] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:06,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804410655] [2023-11-29 06:43:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:06,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:06,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 06:43:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:06,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 88 conjunts are in the unsatisfiable core [2023-11-29 06:43:06,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:06,501 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 [2023-11-29 06:43:06,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:06,678 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 [2023-11-29 06:43:06,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:06,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:06,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 06:43:06,967 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 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 06:43:06,973 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 13 treesize of output 9 [2023-11-29 06:43:07,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 06:43:07,175 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 [2023-11-29 06:43:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:43:07,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:07,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:07,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-11-29 06:43:07,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:07,661 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 64 treesize of output 63 [2023-11-29 06:43:07,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-29 06:43:07,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:07,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-29 06:43:07,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-29 06:43:07,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 06:43:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:43:08,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804410655] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:08,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:08,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 54 [2023-11-29 06:43:08,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603945272] [2023-11-29 06:43:08,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:08,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 06:43:08,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:08,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 06:43:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2653, Unknown=35, NotChecked=0, Total=2862 [2023-11-29 06:43:08,297 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 54 states, 49 states have (on average 1.653061224489796) internal successors, (81), 45 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 06:43:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:09,973 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2023-11-29 06:43:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 06:43:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 49 states have (on average 1.653061224489796) internal successors, (81), 45 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2023-11-29 06:43:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:09,976 INFO L225 Difference]: With dead ends: 130 [2023-11-29 06:43:09,976 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 06:43:09,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=402, Invalid=5113, Unknown=35, NotChecked=0, Total=5550 [2023-11-29 06:43:09,981 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 454 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:09,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1069 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:43:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 06:43:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 83. [2023-11-29 06:43:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 78 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) [2023-11-29 06:43:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-11-29 06:43:09,986 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 35 [2023-11-29 06:43:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:09,986 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-11-29 06:43:09,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 49 states have (on average 1.653061224489796) internal successors, (81), 45 states have internal predecessors, (81), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 06:43:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-11-29 06:43:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 06:43:09,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:09,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:09,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 06:43:10,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:10,188 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:10,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -724047555, now seen corresponding path program 4 times [2023-11-29 06:43:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:10,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80748367] [2023-11-29 06:43:10,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:43:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 06:43:10,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:10,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80748367] [2023-11-29 06:43:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80748367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170538396] [2023-11-29 06:43:10,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:43:10,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:10,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:10,303 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:10,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 06:43:10,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:43:10,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:43:10,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-29 06:43:10,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:10,494 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 [2023-11-29 06:43:10,570 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:43:10,570 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 [2023-11-29 06:43:10,721 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-29 06:43:10,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-29 06:43:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:43:10,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 06:43:10,963 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 33 treesize of output 17 [2023-11-29 06:43:11,092 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 25 treesize of output 13 [2023-11-29 06:43:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:43:11,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:11,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:11,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-11-29 06:43:11,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2023-11-29 06:43:11,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 06:43:11,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170538396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:11,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:11,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 21] total 25 [2023-11-29 06:43:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369525808] [2023-11-29 06:43:11,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:11,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 06:43:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 06:43:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 06:43:11,658 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 25 states, 22 states have (on average 2.272727272727273) internal successors, (50), 20 states have internal predecessors, (50), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 06:43:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:12,308 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2023-11-29 06:43:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:43:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.272727272727273) internal successors, (50), 20 states have internal predecessors, (50), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2023-11-29 06:43:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:12,309 INFO L225 Difference]: With dead ends: 68 [2023-11-29 06:43:12,309 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 06:43:12,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=1618, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 06:43:12,311 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:12,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 566 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 06:43:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 06:43:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-11-29 06:43:12,314 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 36 [2023-11-29 06:43:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:12,314 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-11-29 06:43:12,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.272727272727273) internal successors, (50), 20 states have internal predecessors, (50), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 06:43:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-11-29 06:43:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 06:43:12,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:12,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:12,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 06:43:12,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:12,515 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:12,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 764464221, now seen corresponding path program 1 times [2023-11-29 06:43:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346820367] [2023-11-29 06:43:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:43:12,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:12,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346820367] [2023-11-29 06:43:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346820367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769515593] [2023-11-29 06:43:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:12,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:12,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:12,616 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:12,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 06:43:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:12,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:12,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:43:12,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:43:12,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769515593] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:12,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2023-11-29 06:43:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799990340] [2023-11-29 06:43:12,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:12,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:43:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:43:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:12,909 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:13,009 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-29 06:43:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 06:43:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2023-11-29 06:43:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:13,010 INFO L225 Difference]: With dead ends: 65 [2023-11-29 06:43:13,010 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 06:43:13,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:43:13,011 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:13,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 182 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 06:43:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 06:43:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2023-11-29 06:43:13,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 38 [2023-11-29 06:43:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:13,015 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2023-11-29 06:43:13,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2023-11-29 06:43:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 06:43:13,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:13,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:13,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 06:43:13,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:13,222 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:13,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 764464166, now seen corresponding path program 1 times [2023-11-29 06:43:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375992074] [2023-11-29 06:43:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:13,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:43:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375992074] [2023-11-29 06:43:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375992074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325301137] [2023-11-29 06:43:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:13,975 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:13,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 06:43:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:14,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 06:43:14,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:14,178 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 [2023-11-29 06:43:14,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:14,259 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 [2023-11-29 06:43:14,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:14,340 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:14,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 06:43:14,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:14,405 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 17 [2023-11-29 06:43:14,499 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:14,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 06:43:14,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:43:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 06:43:14,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:14,707 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2258 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2023-11-29 06:43:14,940 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2023-11-29 06:43:14,940 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 47 treesize of output 46 [2023-11-29 06:43:14,948 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_2256 Int) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2255 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2255))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4) v_ArrVal_2256))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2258))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-29 06:43:14,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:14,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 62 [2023-11-29 06:43:14,969 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 113 treesize of output 105 [2023-11-29 06:43:14,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:14,975 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 84 treesize of output 78 [2023-11-29 06:43:14,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:14,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2023-11-29 06:43:14,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-29 06:43:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325301137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:15,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2023-11-29 06:43:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462010517] [2023-11-29 06:43:15,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:15,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 06:43:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 06:43:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1027, Unknown=56, NotChecked=134, Total=1332 [2023-11-29 06:43:15,064 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 30 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:43:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:15,523 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2023-11-29 06:43:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:43:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-11-29 06:43:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:15,524 INFO L225 Difference]: With dead ends: 83 [2023-11-29 06:43:15,524 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 06:43:15,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=1423, Unknown=59, NotChecked=158, Total=1806 [2023-11-29 06:43:15,525 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 79 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:15,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 602 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 06:43:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-11-29 06:43:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3125) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-11-29 06:43:15,528 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 38 [2023-11-29 06:43:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:15,528 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-11-29 06:43:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:43:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-11-29 06:43:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 06:43:15,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:15,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:15,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 06:43:15,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 06:43:15,729 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:15,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash 764464167, now seen corresponding path program 1 times [2023-11-29 06:43:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66369383] [2023-11-29 06:43:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:43:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66369383] [2023-11-29 06:43:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66369383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935035879] [2023-11-29 06:43:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:16,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:16,797 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:16,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 06:43:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:17,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 06:43:17,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:17,043 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 [2023-11-29 06:43:17,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:17,202 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 [2023-11-29 06:43:17,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:17,316 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:17,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 06:43:17,381 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 8 treesize of output 1 [2023-11-29 06:43:17,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:17,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 06:43:17,490 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:17,490 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 56 treesize of output 51 [2023-11-29 06:43:17,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2023-11-29 06:43:17,633 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 31 treesize of output 19 [2023-11-29 06:43:17,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 06:43:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:43:17,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:17,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:17,807 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 42 treesize of output 46 [2023-11-29 06:43:18,104 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 629 treesize of output 589 [2023-11-29 06:43:18,117 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 225 treesize of output 221 [2023-11-29 06:43:18,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 227 [2023-11-29 06:43:18,128 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 217 treesize of output 213 [2023-11-29 06:43:18,411 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2393 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2393) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-29 06:43:18,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:18,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-29 06:43:18,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-29 06:43:18,427 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 6 treesize of output 4 [2023-11-29 06:43:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-29 06:43:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935035879] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:18,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 51 [2023-11-29 06:43:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756196048] [2023-11-29 06:43:18,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:18,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 06:43:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 06:43:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2376, Unknown=1, NotChecked=98, Total=2652 [2023-11-29 06:43:18,830 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 52 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 43 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 06:43:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:19,865 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2023-11-29 06:43:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:43:19,865 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 43 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2023-11-29 06:43:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:19,866 INFO L225 Difference]: With dead ends: 63 [2023-11-29 06:43:19,866 INFO L226 Difference]: Without dead ends: 63 [2023-11-29 06:43:19,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=269, Invalid=3274, Unknown=1, NotChecked=116, Total=3660 [2023-11-29 06:43:19,868 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 93 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:19,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 888 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 750 Invalid, 0 Unknown, 56 Unchecked, 0.5s Time] [2023-11-29 06:43:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-29 06:43:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2023-11-29 06:43:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.297872340425532) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2023-11-29 06:43:19,870 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 38 [2023-11-29 06:43:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:19,870 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2023-11-29 06:43:19,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 43 states have internal predecessors, (95), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 06:43:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2023-11-29 06:43:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 06:43:19,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:19,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:19,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 06:43:20,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:20,072 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:20,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2073001121, now seen corresponding path program 1 times [2023-11-29 06:43:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634572472] [2023-11-29 06:43:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:43:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634572472] [2023-11-29 06:43:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634572472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:20,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714929252] [2023-11-29 06:43:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:20,145 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:20,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 06:43:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:20,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:43:20,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:43:20,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 06:43:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714929252] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:20,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-29 06:43:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733434654] [2023-11-29 06:43:20,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:20,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:43:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:43:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:20,401 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:20,477 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2023-11-29 06:43:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-11-29 06:43:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:20,479 INFO L225 Difference]: With dead ends: 62 [2023-11-29 06:43:20,479 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:43:20,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:20,480 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:20,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 149 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:43:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 06:43:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 58 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2023-11-29 06:43:20,483 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 39 [2023-11-29 06:43:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:20,483 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2023-11-29 06:43:20,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:43:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2023-11-29 06:43:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 06:43:20,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:20,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:20,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 06:43:20,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:20,685 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:20,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2056373387, now seen corresponding path program 1 times [2023-11-29 06:43:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546476381] [2023-11-29 06:43:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 06:43:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546476381] [2023-11-29 06:43:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546476381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280481125] [2023-11-29 06:43:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:22,027 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:22,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 06:43:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:22,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 105 conjunts are in the unsatisfiable core [2023-11-29 06:43:22,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:22,245 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 [2023-11-29 06:43:22,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:22,428 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 [2023-11-29 06:43:22,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:22,599 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:22,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 06:43:22,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:22,735 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 28 treesize of output 12 [2023-11-29 06:43:22,968 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:22,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2023-11-29 06:43:22,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-29 06:43:22,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-29 06:43:23,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 06:43:23,256 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 21 treesize of output 13 [2023-11-29 06:43:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:43:23,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:23,534 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 76 treesize of output 56 [2023-11-29 06:43:23,542 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2671 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2671) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_2670 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2670) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2023-11-29 06:43:23,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:23,562 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 38 treesize of output 37 [2023-11-29 06:43:23,566 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 13 treesize of output 11 [2023-11-29 06:43:23,848 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_58| Int) (v_ArrVal_2666 (Array Int Int)) (v_ArrVal_2668 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_58| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2666) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_58| 4) v_ArrVal_2668) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-29 06:43:23,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:23,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-29 06:43:23,866 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 43 treesize of output 39 [2023-11-29 06:43:23,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:23,870 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 27 treesize of output 25 [2023-11-29 06:43:23,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:23,874 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 27 treesize of output 23 [2023-11-29 06:43:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 06:43:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280481125] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:24,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 23] total 64 [2023-11-29 06:43:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564178526] [2023-11-29 06:43:24,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-29 06:43:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-29 06:43:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3596, Unknown=2, NotChecked=242, Total=4032 [2023-11-29 06:43:24,472 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 64 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 55 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 06:43:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:26,222 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-11-29 06:43:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 06:43:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 55 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2023-11-29 06:43:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:26,223 INFO L225 Difference]: With dead ends: 59 [2023-11-29 06:43:26,223 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 06:43:26,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=376, Invalid=5950, Unknown=2, NotChecked=314, Total=6642 [2023-11-29 06:43:26,225 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 143 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:26,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1230 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1120 Invalid, 0 Unknown, 113 Unchecked, 0.7s Time] [2023-11-29 06:43:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 06:43:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-29 06:43:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 55 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2023-11-29 06:43:26,227 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 41 [2023-11-29 06:43:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:26,228 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2023-11-29 06:43:26,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 55 states have internal predecessors, (102), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 06:43:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2023-11-29 06:43:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 06:43:26,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:26,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:26,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 06:43:26,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:26,429 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:26,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash -491400038, now seen corresponding path program 1 times [2023-11-29 06:43:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:26,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487090634] [2023-11-29 06:43:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 06:43:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487090634] [2023-11-29 06:43:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487090634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:26,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:43:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978748250] [2023-11-29 06:43:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:26,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:43:26,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:26,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:43:26,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:26,569 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2023-11-29 06:43:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:26,712 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-11-29 06:43:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:43:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 43 [2023-11-29 06:43:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:26,713 INFO L225 Difference]: With dead ends: 76 [2023-11-29 06:43:26,713 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 06:43:26,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:26,714 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:26,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 174 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 06:43:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2023-11-29 06:43:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-11-29 06:43:26,717 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 43 [2023-11-29 06:43:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:26,717 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-11-29 06:43:26,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2023-11-29 06:43:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-11-29 06:43:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 06:43:26,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:26,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:26,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 06:43:26,718 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:26,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash -491400037, now seen corresponding path program 1 times [2023-11-29 06:43:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:26,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871053672] [2023-11-29 06:43:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 06:43:27,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:27,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871053672] [2023-11-29 06:43:27,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871053672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:27,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:27,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:43:27,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288779309] [2023-11-29 06:43:27,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:27,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:43:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:43:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:27,002 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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) [2023-11-29 06:43:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:27,166 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2023-11-29 06:43:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:43:27,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 43 [2023-11-29 06:43:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:27,167 INFO L225 Difference]: With dead ends: 60 [2023-11-29 06:43:27,167 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 06:43:27,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:27,168 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:27,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 159 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 06:43:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 06:43:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-29 06:43:27,171 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 43 [2023-11-29 06:43:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:27,172 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-29 06:43:27,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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) [2023-11-29 06:43:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-29 06:43:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 06:43:27,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:27,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:27,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 06:43:27,173 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:27,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1946501890, now seen corresponding path program 1 times [2023-11-29 06:43:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610355474] [2023-11-29 06:43:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 06:43:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610355474] [2023-11-29 06:43:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610355474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:43:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274081044] [2023-11-29 06:43:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:27,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:43:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:27,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:43:27,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:27,366 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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) [2023-11-29 06:43:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:27,483 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-11-29 06:43:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:43:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 44 [2023-11-29 06:43:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:27,484 INFO L225 Difference]: With dead ends: 60 [2023-11-29 06:43:27,484 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 06:43:27,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:27,486 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:27,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 06:43:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 06:43:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2023-11-29 06:43:27,488 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 44 [2023-11-29 06:43:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:27,489 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2023-11-29 06:43:27,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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) [2023-11-29 06:43:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2023-11-29 06:43:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 06:43:27,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:27,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:27,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 06:43:27,490 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:27,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash 211038115, now seen corresponding path program 1 times [2023-11-29 06:43:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257392524] [2023-11-29 06:43:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 06:43:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257392524] [2023-11-29 06:43:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257392524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059352603] [2023-11-29 06:43:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:27,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:27,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:27,667 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:27,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 06:43:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 06:43:27,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:28,040 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 [2023-11-29 06:43:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 06:43:28,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:28,113 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-11-29 06:43:28,113 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 16 treesize of output 15 [2023-11-29 06:43:28,155 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 06:43:28,156 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 11 treesize of output 11 [2023-11-29 06:43:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 06:43:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059352603] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:28,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:28,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 6] total 21 [2023-11-29 06:43:28,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766083309] [2023-11-29 06:43:28,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:28,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 06:43:28,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:28,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 06:43:28,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2023-11-29 06:43:28,209 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 22 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 06:43:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:28,461 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2023-11-29 06:43:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:43:28,462 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-11-29 06:43:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:28,463 INFO L225 Difference]: With dead ends: 67 [2023-11-29 06:43:28,463 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 06:43:28,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:43:28,464 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 88 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:28,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 305 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:43:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 06:43:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2023-11-29 06:43:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.2) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-11-29 06:43:28,466 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 45 [2023-11-29 06:43:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:28,466 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-11-29 06:43:28,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 06:43:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-11-29 06:43:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 06:43:28,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:28,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:28,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 06:43:28,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:28,667 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:28,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 211038116, now seen corresponding path program 1 times [2023-11-29 06:43:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789160723] [2023-11-29 06:43:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:28,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:29,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:43:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789160723] [2023-11-29 06:43:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789160723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544971997] [2023-11-29 06:43:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:29,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:29,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:29,506 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:29,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 06:43:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:29,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-29 06:43:29,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:29,720 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 [2023-11-29 06:43:29,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:29,919 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 [2023-11-29 06:43:30,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:30,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:43:30,068 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:30,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 06:43:30,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:43:30,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:30,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 06:43:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:30,191 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 28 treesize of output 12 [2023-11-29 06:43:30,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 06:43:30,312 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 [2023-11-29 06:43:30,616 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 23 treesize of output 15 [2023-11-29 06:43:30,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-29 06:43:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 06:43:30,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:30,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:30,867 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 31 treesize of output 35 [2023-11-29 06:43:30,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:30,958 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 28 treesize of output 32 [2023-11-29 06:43:31,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:31,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2023-11-29 06:43:31,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:31,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-11-29 06:43:31,677 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 57 treesize of output 53 [2023-11-29 06:43:31,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:31,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-29 06:43:31,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:31,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-29 06:43:31,695 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 97 treesize of output 91 [2023-11-29 06:43:31,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:31,700 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 81 treesize of output 75 [2023-11-29 06:43:31,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:31,706 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 61 treesize of output 57 [2023-11-29 06:43:31,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-29 06:43:31,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544971997] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:31,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2023-11-29 06:43:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005919172] [2023-11-29 06:43:31,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:31,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 06:43:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:31,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 06:43:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3205, Unknown=14, NotChecked=0, Total=3422 [2023-11-29 06:43:31,933 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 44 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:43:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:33,023 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2023-11-29 06:43:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:43:33,024 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2023-11-29 06:43:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:33,024 INFO L225 Difference]: With dead ends: 65 [2023-11-29 06:43:33,024 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 06:43:33,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=376, Invalid=4866, Unknown=14, NotChecked=0, Total=5256 [2023-11-29 06:43:33,026 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 290 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:33,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 507 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 06:43:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 06:43:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2023-11-29 06:43:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2023-11-29 06:43:33,028 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 45 [2023-11-29 06:43:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:33,028 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2023-11-29 06:43:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:43:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2023-11-29 06:43:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 06:43:33,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:33,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:33,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 06:43:33,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:33,229 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:33,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2047754410, now seen corresponding path program 1 times [2023-11-29 06:43:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102235325] [2023-11-29 06:43:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 06:43:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102235325] [2023-11-29 06:43:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102235325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:33,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:33,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 06:43:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786366364] [2023-11-29 06:43:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:33,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:43:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:43:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:33,390 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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) [2023-11-29 06:43:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:33,521 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2023-11-29 06:43:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:43:33,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 46 [2023-11-29 06:43:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:33,522 INFO L225 Difference]: With dead ends: 60 [2023-11-29 06:43:33,522 INFO L226 Difference]: Without dead ends: 60 [2023-11-29 06:43:33,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:33,523 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:33,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-29 06:43:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-29 06:43:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 56 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2023-11-29 06:43:33,526 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 46 [2023-11-29 06:43:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:33,526 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2023-11-29 06:43:33,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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) [2023-11-29 06:43:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2023-11-29 06:43:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 06:43:33,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:33,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:33,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 06:43:33,527 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:33,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 944230179, now seen corresponding path program 1 times [2023-11-29 06:43:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:33,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788668044] [2023-11-29 06:43:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:43:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788668044] [2023-11-29 06:43:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788668044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778614525] [2023-11-29 06:43:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:34,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:34,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:34,260 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:34,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 06:43:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:34,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-29 06:43:34,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:34,501 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 [2023-11-29 06:43:34,530 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 [2023-11-29 06:43:34,570 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:34,570 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 [2023-11-29 06:43:34,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:34,631 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:34,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 06:43:34,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:34,695 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 17 [2023-11-29 06:43:34,813 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:34,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 06:43:34,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:43:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 06:43:34,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:35,303 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3403 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3403) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3403 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3403) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2023-11-29 06:43:35,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:35,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-11-29 06:43:35,320 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 22 [2023-11-29 06:43:35,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 06:43:35,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:35,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-29 06:43:35,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:35,336 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 17 treesize of output 9 [2023-11-29 06:43:35,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778614525] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:35,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:35,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 28 [2023-11-29 06:43:35,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035987295] [2023-11-29 06:43:35,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:35,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 06:43:35,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 06:43:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1081, Unknown=1, NotChecked=66, Total=1260 [2023-11-29 06:43:35,479 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:35,989 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2023-11-29 06:43:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:43:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2023-11-29 06:43:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:35,990 INFO L225 Difference]: With dead ends: 62 [2023-11-29 06:43:35,990 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:43:35,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=1483, Unknown=1, NotChecked=78, Total=1722 [2023-11-29 06:43:35,991 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 122 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:35,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 284 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:43:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-11-29 06:43:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 57 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2023-11-29 06:43:35,993 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 47 [2023-11-29 06:43:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:35,993 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2023-11-29 06:43:35,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2023-11-29 06:43:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 06:43:35,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:35,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:35,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 06:43:36,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 06:43:36,194 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:36,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1064012033, now seen corresponding path program 1 times [2023-11-29 06:43:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442886061] [2023-11-29 06:43:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:36,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:43:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442886061] [2023-11-29 06:43:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442886061] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193545213] [2023-11-29 06:43:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:36,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:36,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:36,757 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:36,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 06:43:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:36,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 06:43:36,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:36,986 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 [2023-11-29 06:43:37,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:37,033 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 [2023-11-29 06:43:37,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:37,085 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:37,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 06:43:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:37,125 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 28 treesize of output 12 [2023-11-29 06:43:37,193 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:37,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-29 06:43:37,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:37,254 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 16 treesize of output 16 [2023-11-29 06:43:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 06:43:37,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:37,424 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3546 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3546) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2023-11-29 06:43:37,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3546 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3546) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2023-11-29 06:43:37,436 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3545 Int) (v_ArrVal_3546 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3545)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3546)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2023-11-29 06:43:37,448 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3545 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_70| Int) (v_ArrVal_3546 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_70| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_70| 4) v_ArrVal_3545))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3546)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2023-11-29 06:43:37,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3543 (Array Int Int)) (v_ArrVal_3545 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_70| Int) (v_ArrVal_3546 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3543))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_70| 4) v_ArrVal_3545))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3546))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_70| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-29 06:43:37,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:37,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 65 [2023-11-29 06:43:37,472 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 117 treesize of output 109 [2023-11-29 06:43:37,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:37,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:37,482 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 112 treesize of output 112 [2023-11-29 06:43:37,486 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:37,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:37,493 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 102 treesize of output 105 [2023-11-29 06:43:37,498 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 96 treesize of output 94 [2023-11-29 06:43:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2023-11-29 06:43:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193545213] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:43:37,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:43:37,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 45 [2023-11-29 06:43:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669425846] [2023-11-29 06:43:37,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:37,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 06:43:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 06:43:37,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1452, Unknown=12, NotChecked=400, Total=1980 [2023-11-29 06:43:37,982 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 45 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:43:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:38,801 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2023-11-29 06:43:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:43:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2023-11-29 06:43:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:38,802 INFO L225 Difference]: With dead ends: 59 [2023-11-29 06:43:38,802 INFO L226 Difference]: Without dead ends: 59 [2023-11-29 06:43:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=2267, Unknown=12, NotChecked=500, Total=2970 [2023-11-29 06:43:38,803 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 100 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:38,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 470 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 775 Invalid, 0 Unknown, 264 Unchecked, 0.5s Time] [2023-11-29 06:43:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-29 06:43:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-11-29 06:43:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2023-11-29 06:43:38,805 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 49 [2023-11-29 06:43:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:38,805 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2023-11-29 06:43:38,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.317073170731707) internal successors, (95), 38 states have internal predecessors, (95), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 06:43:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2023-11-29 06:43:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 06:43:38,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:38,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:38,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 06:43:39,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 06:43:39,006 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:39,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1820599648, now seen corresponding path program 1 times [2023-11-29 06:43:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919466834] [2023-11-29 06:43:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 06:43:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919466834] [2023-11-29 06:43:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919466834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398417622] [2023-11-29 06:43:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:40,213 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:40,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 06:43:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:40,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 06:43:40,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:40,444 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 [2023-11-29 06:43:40,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 06:43:40,526 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 [2023-11-29 06:43:40,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:43:40,637 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:40,638 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 47 treesize of output 33 [2023-11-29 06:43:40,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 06:43:40,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:40,750 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 06:43:40,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2023-11-29 06:43:40,757 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 [2023-11-29 06:43:40,933 INFO L349 Elim1Store]: treesize reduction 62, result has 25.3 percent of original size [2023-11-29 06:43:40,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 72 [2023-11-29 06:43:40,951 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2023-11-29 06:43:40,951 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 1 case distinctions, treesize of input 50 treesize of output 31 [2023-11-29 06:43:41,343 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-11-29 06:43:41,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 47 [2023-11-29 06:43:41,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:41,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 06:43:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 06:43:41,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:46,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse6 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_3689 Int) (v_ArrVal_3687 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3687))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_ArrVal_3691 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse5 .cse6 v_ArrVal_3689)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (let ((.cse1 (store .cse0 .cse3 (store (select .cse0 .cse3) .cse4 v_ArrVal_3691)))) (or (< (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (forall ((v_ArrVal_3690 Int)) (= (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_3690)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) (forall ((v_ArrVal_3689 Int) (v_ArrVal_3687 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse5 .cse6 v_ArrVal_3689)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3687)) (.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3691 Int)) (< (select (select (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_ArrVal_3691)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_ArrVal_3690 Int)) (= (select (let ((.cse10 (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 v_ArrVal_3690)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))))))) is different from false [2023-11-29 06:43:46,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3689 Int) (v_ArrVal_3687 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| (select v_ArrVal_3687 |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_ArrVal_3691 Int)) (let ((.cse4 (store .cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3687))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_3691))))) (or (forall ((v_ArrVal_3690 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3690))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 0))) (< (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3689 Int) (v_ArrVal_3687 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (let ((.cse12 (store .cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4))) (or (forall ((v_ArrVal_3691 Int)) (< (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3687))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_ArrVal_3691))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| (select v_ArrVal_3687 |c_ULTIMATE.start_main_~s~0#1.offset|)) (forall ((v_ArrVal_3690 Int)) (= (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse12))) (store .cse11 .cse8 (store (select .cse11 .cse8) .cse9 v_ArrVal_3690))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))))))))) is different from false [2023-11-29 06:43:46,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:46,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2023-11-29 06:43:46,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:46,967 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 189 treesize of output 193 [2023-11-29 06:43:46,977 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 82 treesize of output 76 [2023-11-29 06:43:46,988 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 6 treesize of output 4 [2023-11-29 06:43:47,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:47,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 223 [2023-11-29 06:43:47,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:47,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2936 treesize of output 2829 [2023-11-29 06:43:47,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:47,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1571 treesize of output 1565 [2023-11-29 06:43:47,175 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 6 treesize of output 4 [2023-11-29 06:43:47,386 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 6 treesize of output 4 [2023-11-29 06:43:47,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:47,486 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 1206 treesize of output 1204 [2023-11-29 06:43:54,493 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse49 (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 1)) (.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse0 (let ((.cse3 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse1 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse8 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse8))) (store .cse6 .cse7 (store (select .cse6 .cse7) 0 v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse7))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (forall ((v_ArrVal_3689 Int)) (let ((.cse11 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse11))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (forall ((v_ArrVal_3689 Int)) (let ((.cse15 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse12 (select (select (let ((.cse13 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse15))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse12)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse12)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse14)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse19 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse16 (select (select (let ((.cse18 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse19))) (store .cse18 .cse17 (store (select .cse18 .cse17) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse16 .cse17) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse16)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse17))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (forall ((v_ArrVal_3689 Int)) (let ((.cse23 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse20 (select (select (let ((.cse22 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse23))) (store .cse22 .cse21 (store (select .cse22 .cse21) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse20 .cse21) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse21)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse27 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse24 (select (select (let ((.cse25 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse27))) (store .cse25 .cse26 (store (select .cse25 .cse26) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse24) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse24)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse26))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse31 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse28 (select (select (let ((.cse29 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse31))) (store .cse29 .cse30 (store (select .cse29 .cse30) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse28) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse30)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse34 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (not (= (select (select (let ((.cse32 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse34))) (store .cse32 .cse33 (store (select .cse32 .cse33) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse33))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse33)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (forall ((v_ArrVal_3689 Int)) (let ((.cse37 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse35 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse37))) (store .cse35 .cse36 (store (select .cse35 .cse36) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse36)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (forall ((v_ArrVal_3689 Int)) (let ((.cse40 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse38 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse40))) (store .cse38 .cse39 (store (select .cse38 .cse39) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse39))))))))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int) (v_ArrVal_3690 Int)) (let ((.cse44 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse41 (let ((.cse42 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse44))) (store .cse42 .cse43 (store (select .cse42 .cse43) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse43)))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse48 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse45 (select (select (let ((.cse46 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse48))) (store .cse46 .cse47 (store (select .cse46 .cse47) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse45) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse45)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse47)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse47))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (or .cse49 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int) (v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (let ((.cse53 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse50 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse53)) (.cse51 (select .cse53 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse52 (select .cse50 .cse51))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse50 .cse51 (store .cse52 0 v_ArrVal_3690)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store .cse50 .cse51 (store .cse52 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse51))))))) (or .cse49 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int) (v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (let ((.cse57 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse55 (select .cse57 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse54 (select (select (let ((.cse56 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse57))) (store .cse56 .cse55 (store (select .cse56 .cse55) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse54 .cse55) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse54) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse55))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse61 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse60 (select .cse61 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse58 (select (select (let ((.cse59 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse61))) (store .cse59 .cse60 (store (select .cse59 .cse60) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse58) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse58)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse60)))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse64 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse63 (select .cse64 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse62 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse64))) (store .cse62 .cse63 (store (select .cse62 .cse63) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse63)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse65 (select (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse65) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse65)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse68 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse67 (select .cse68 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse66 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse68))) (store .cse66 .cse67 (store (select .cse66 .cse67) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse67)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse67))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse72 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse70 (select .cse72 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse69 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse72))) (let ((.cse71 (select .cse69 .cse70))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store .cse69 .cse70 (store .cse71 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse69 .cse70 (store .cse71 0 v_ArrVal_3690)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse70))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse75 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse74 (select .cse75 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse73 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse75))) (store .cse73 .cse74 (store (select .cse73 .cse74) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse74))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse79 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse77 (select .cse79 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse76 (select (select (let ((.cse78 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse79))) (store .cse78 .cse77 (store (select .cse78 .cse77) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse76) (= .cse77 .cse76)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse77))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse83 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse82 (select .cse83 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse80 (select (select (let ((.cse81 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse83))) (store .cse81 .cse82 (store (select .cse81 .cse82) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse80) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse80)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse82)))))))) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (or .cse49 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int) (v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (let ((.cse86 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse85 (select .cse86 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (not (= (select (select (let ((.cse84 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse86))) (store .cse84 .cse85 (store (select .cse84 .cse85) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse85)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse85))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse90 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse88 (select .cse90 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse87 (select (select (let ((.cse89 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse90))) (store .cse89 .cse88 (store (select .cse89 .cse88) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse87) (= .cse88 .cse87)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse88)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse88))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (let ((.cse94 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse92 (select .cse94 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse91 (select (select (let ((.cse93 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse94))) (store .cse93 .cse92 (store (select .cse93 .cse92) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse91) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse91) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse92)))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse98 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse97 (select .cse98 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse95 (select (select (let ((.cse96 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse98))) (store .cse96 .cse97 (store (select .cse96 .cse97) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse95) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse95))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse97)))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse101 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse100 (select .cse101 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse99 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse101))) (store .cse99 .cse100 (store (select .cse99 .cse100) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse100)))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse105 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse103 (select .cse105 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse102 (select (select (let ((.cse104 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse105))) (store .cse104 .cse103 (store (select .cse104 .cse103) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse102) (= .cse103 .cse102)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse103)))))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or .cse49 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int) (v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (let ((.cse108 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse107 (select .cse108 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse106 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse108))) (store .cse106 .cse107 (store (select .cse106 .cse107) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse107)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (or .cse49 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int) (v_ArrVal_3689 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| Int) (v_ArrVal_3690 Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse111 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse109 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse111)) (.cse110 (select .cse111 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse109 .cse110 (store (select .cse109 .cse110) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 4) v_ArrVal_3690)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_74| 0)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (forall ((v_ArrVal_3689 Int)) (let ((.cse115 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse113 (select .cse115 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (let ((.cse112 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse115))) (let ((.cse114 (select .cse112 .cse113))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store .cse112 .cse113 (store .cse114 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse112 .cse113 (store .cse114 0 v_ArrVal_3690)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse113)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse113))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_3689 Int)) (let ((.cse118 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_76| 4) v_ArrVal_3689))) (let ((.cse116 (select .cse118 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_3690 Int)) (not (= .cse116 (select (select (let ((.cse117 (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse118))) (store .cse117 .cse116 (store (select .cse117 .cse116) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_3690))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse116))))))))))) is different from true [2023-11-29 06:43:55,971 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 06:43:55,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 725 treesize of output 295 [2023-11-29 06:43:55,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:55,986 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 73 treesize of output 71 [2023-11-29 06:43:55,994 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 6 treesize of output 4 [2023-11-29 06:43:56,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:56,014 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 33 treesize of output 35 [2023-11-29 06:43:56,064 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1092 treesize of output 1 [2023-11-29 06:43:56,078 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 852 treesize of output 1 [2023-11-29 06:43:56,091 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 863 treesize of output 1 [2023-11-29 06:43:56,133 INFO L349 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2023-11-29 06:43:56,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1091 treesize of output 652 [2023-11-29 06:43:56,193 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-11-29 06:43:56,194 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 4 case distinctions, treesize of input 122 treesize of output 108 [2023-11-29 06:43:56,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:56,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 90 [2023-11-29 06:43:56,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:56,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2023-11-29 06:43:56,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2023-11-29 06:43:56,285 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,290 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 90 treesize of output 74 [2023-11-29 06:43:56,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,333 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1672 treesize of output 1 [2023-11-29 06:43:56,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,347 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1097 treesize of output 1 [2023-11-29 06:43:56,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,360 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 862 treesize of output 1 [2023-11-29 06:43:56,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,370 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 272 treesize of output 1 [2023-11-29 06:43:56,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,383 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1671 treesize of output 1 [2023-11-29 06:43:56,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,397 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 1 [2023-11-29 06:43:56,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,409 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 862 treesize of output 1 [2023-11-29 06:43:56,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,417 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,421 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1396 treesize of output 1 [2023-11-29 06:43:56,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,432 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1432 treesize of output 1 [2023-11-29 06:43:56,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,443 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 714 treesize of output 1 [2023-11-29 06:43:56,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,482 INFO L349 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2023-11-29 06:43:56,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1091 treesize of output 652 [2023-11-29 06:43:56,490 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:56,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 95 [2023-11-29 06:43:56,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2023-11-29 06:43:56,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,519 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,526 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 761 treesize of output 1 [2023-11-29 06:43:56,531 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,546 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-29 06:43:56,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 10652 treesize of output 1 [2023-11-29 06:43:56,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,559 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 883 treesize of output 1 [2023-11-29 06:43:56,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,572 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 991 treesize of output 1 [2023-11-29 06:43:56,578 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,588 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1671 treesize of output 1 [2023-11-29 06:43:56,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,601 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 852 treesize of output 1 [2023-11-29 06:43:56,611 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 1 [2023-11-29 06:43:56,616 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,624 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 878 treesize of output 1 [2023-11-29 06:43:56,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,640 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-29 06:43:56,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 1092 treesize of output 1 [2023-11-29 06:43:56,647 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,676 INFO L349 Elim1Store]: treesize reduction 185, result has 0.5 percent of original size [2023-11-29 06:43:56,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 11 new quantified variables, introduced 16 case distinctions, treesize of input 19116 treesize of output 1 [2023-11-29 06:43:56,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,687 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 1 [2023-11-29 06:43:56,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,698 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 914 treesize of output 1 [2023-11-29 06:43:56,708 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,715 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 877 treesize of output 1 [2023-11-29 06:43:56,720 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,728 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 954 treesize of output 1 [2023-11-29 06:43:56,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,739 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 724 treesize of output 1 [2023-11-29 06:43:56,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,753 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1395 treesize of output 1 [2023-11-29 06:43:56,759 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:43:56,766 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 234 treesize of output 1 [2023-11-29 06:43:56,776 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 1 [2023-11-29 06:43:56,786 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 06:43:56,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2023-11-29 06:43:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398417622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:57,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2023-11-29 06:43:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139802661] [2023-11-29 06:43:57,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:57,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 06:43:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 06:43:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2191, Unknown=4, NotChecked=288, Total=2652 [2023-11-29 06:43:57,101 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 39 states, 37 states have (on average 2.135135135135135) internal successors, (79), 34 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:43:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:58,613 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2023-11-29 06:43:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:43:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.135135135135135) internal successors, (79), 34 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2023-11-29 06:43:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:58,615 INFO L225 Difference]: With dead ends: 51 [2023-11-29 06:43:58,615 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 06:43:58,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=284, Invalid=3030, Unknown=4, NotChecked=342, Total=3660 [2023-11-29 06:43:58,616 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 124 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:58,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 416 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:43:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 06:43:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-29 06:43:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:43:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2023-11-29 06:43:58,618 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 50 [2023-11-29 06:43:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:58,619 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2023-11-29 06:43:58,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.135135135135135) internal successors, (79), 34 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:43:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2023-11-29 06:43:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 06:43:58,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:58,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:58,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 06:43:58,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-29 06:43:58,821 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:43:58,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1544529552, now seen corresponding path program 1 times [2023-11-29 06:43:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461098400] [2023-11-29 06:43:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:43:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:43:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:43:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461098400] [2023-11-29 06:43:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461098400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876824238] [2023-11-29 06:43:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:59,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:43:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:59,760 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:43:59,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 06:44:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:00,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 06:44:00,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:00,218 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 06:44:00,219 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 [2023-11-29 06:44:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 06:44:00,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:44:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 06:44:00,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876824238] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:44:00,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:44:00,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 30 [2023-11-29 06:44:00,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139783260] [2023-11-29 06:44:00,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:44:00,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 06:44:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:44:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 06:44:00,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2023-11-29 06:44:00,458 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 31 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:44:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:44:01,069 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2023-11-29 06:44:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:44:01,069 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2023-11-29 06:44:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:44:01,070 INFO L225 Difference]: With dead ends: 50 [2023-11-29 06:44:01,070 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 06:44:01,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 06:44:01,071 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:44:01,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 266 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:44:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 06:44:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 06:44:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:44:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2023-11-29 06:44:01,073 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 52 [2023-11-29 06:44:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:44:01,073 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2023-11-29 06:44:01,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 06:44:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2023-11-29 06:44:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 06:44:01,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:44:01,074 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:01,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-29 06:44:01,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 06:44:01,274 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2023-11-29 06:44:01,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1765779394, now seen corresponding path program 1 times [2023-11-29 06:44:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:44:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607306878] [2023-11-29 06:44:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:44:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 06:44:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:02,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 06:44:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 06:44:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:44:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607306878] [2023-11-29 06:44:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607306878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:44:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638705945] [2023-11-29 06:44:02,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:02,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:44:02,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:44:02,523 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:44:02,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 06:44:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:02,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-29 06:44:02,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:02,910 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2023-11-29 06:44:02,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2023-11-29 06:44:03,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:44:03,221 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 30 treesize of output 23 [2023-11-29 06:44:03,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:44:03,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2023-11-29 06:44:03,865 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-29 06:44:03,866 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 38 treesize of output 41 [2023-11-29 06:44:03,873 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 23 treesize of output 17 [2023-11-29 06:44:04,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:44:04,385 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 29 treesize of output 25 [2023-11-29 06:44:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 06:44:09,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:44:09,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3971 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3971) |c_ULTIMATE.start_main_~s~0#1.base|) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 06:44:09,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3971 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3971) |c_ULTIMATE.start_main_~s~0#1.base|) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 06:44:09,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3971 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3971) |c_ULTIMATE.start_main_~s~0#1.base|) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 06:44:09,948 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3969 Int) (v_ArrVal_3971 (Array Int Int))) (= (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3969)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3971)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 06:44:09,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3969 Int) (v_ArrVal_3971 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_ArrVal_3969))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3971)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-29 06:44:09,975 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3969 Int) (v_ArrVal_3971 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| Int) (v_ArrVal_3968 (Array Int Int))) (or (= (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3968))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| 4) v_ArrVal_3969))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3971))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_80| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-29 06:44:09,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:44:09,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 82 [2023-11-29 06:44:09,996 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 143 treesize of output 135 [2023-11-29 06:44:09,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:44:10,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:44:10,012 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 147 treesize of output 147 [2023-11-29 06:44:10,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:44:10,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:44:10,031 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 147 treesize of output 149 [2023-11-29 06:44:10,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-11-29 06:45:09,506 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (.cse9 (< 0 (+ |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 4))) (.cse26 (store (store |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0)) (.cse31 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (let ((.cse30 (or .cse31 .cse2)) (.cse32 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse43 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse43 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_229 Int)) (= .cse43 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse28 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse42 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse42 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse42 (select .cse26 v_antiDerIndex_entry0_1)))))) (.cse21 (or .cse31 .cse9)) (.cse4 (not .cse14))) (let ((.cse33 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_229 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0)) (.cse10 (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_228 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) .cse21 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_228 Int)) (let ((.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse41 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse4)) (.cse24 (or .cse2 .cse28)) (.cse13 (or .cse9 (and .cse30 .cse32))) (.cse27 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_229 Int)) (let ((.cse40 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse40 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select .cse26 v_antiDerIndex_entry0_1))))))) (and (or .cse0 (let ((.cse7 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int)) (let ((.cse19 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse19 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse19 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))))) (let ((.cse3 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int) (v_arrayElimCell_228 Int)) (let ((.cse18 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse18 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse5 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int) (v_arrayElimCell_228 Int)) (let ((.cse17 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse17 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse12 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int) (v_arrayElimCell_229 Int)) (let ((.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse16 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse6 (or .cse2 .cse7))) (and (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int) (v_arrayElimCell_229 Int) (v_arrayElimCell_228 Int)) (let ((.cse1 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse1 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse1 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse2 .cse3) (or .cse4 .cse3) (or .cse5 .cse2) (or (and .cse6 (or .cse4 .cse7) (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse8 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_229 Int)) (= .cse8 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse8 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse9) .cse10 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int) (v_arrayElimCell_228 Int)) (let ((.cse11 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_229 Int)) (= .cse11 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse11 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse11 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and .cse12 .cse13 .cse6) .cse14) (or .cse5 .cse4) (or .cse14 (and .cse12 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int)) (let ((.cse15 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_229 Int)) (= .cse15 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse15 (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) .cse6 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_226 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_226 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) .cse2))))))) (or .cse4 (and (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_227 Int) (v_arrayElimCell_229 Int)) (let ((.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse20 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse20 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse20 (select (store (store |c_#valid| v_arrayElimCell_227 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_227 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_227 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_227))) .cse21 (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_227 Int)) (= .cse22 (select (store (store |c_#valid| v_arrayElimCell_227 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_229 Int)) (= .cse22 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_227 Int)) (let ((.cse23 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse23 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse23 (select (store (store |c_#valid| v_arrayElimCell_227 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_227)))))) (or (and .cse24 (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse25 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_229 Int)) (= .cse25 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse25 (select .cse26 v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse26 v_antiDerIndex_entry0_1))) .cse2) .cse27) .cse14) (or (and .cse24 (or .cse4 .cse28) (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse29 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse29 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_229 Int)) (= .cse29 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse29 (select .cse26 v_antiDerIndex_entry0_1)))))) .cse9) (or (and .cse30 (or .cse31 .cse4) .cse32) .cse9) (or .cse33 .cse14 (not .cse2)) (or .cse33 .cse4) (or .cse0 (let ((.cse34 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_228 Int)) (let ((.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse39 (select .cse26 v_antiDerIndex_entry0_1)) (= .cse39 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse35 (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_228 Int)) (let ((.cse38 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse38 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse38 (select .cse26 v_antiDerIndex_entry0_1)) (= .cse38 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse34 .cse4) (or .cse35 .cse4) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_228 Int)) (let ((.cse36 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_229 Int)) (= .cse36 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse36 (select .cse26 v_antiDerIndex_entry0_1)) (= .cse36 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10 (or .cse34 .cse2) (forall ((v_ArrVal_3969 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_229 Int) (v_arrayElimCell_228 Int)) (let ((.cse37 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse37 (select (store (store |c_#valid| v_ArrVal_3969 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store (store |c_#valid| v_arrayElimCell_229 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse37 (select .cse26 v_antiDerIndex_entry0_1)) (= .cse37 (select (store (store |c_#valid| v_arrayElimCell_228 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse35 .cse2) (or (and .cse24 .cse13 .cse27) .cse14)))))))) is different from false [2023-11-29 06:45:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638705945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:45:10,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:45:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 35 [2023-11-29 06:45:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040000493] [2023-11-29 06:45:10,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:45:10,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 06:45:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:45:10,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 06:45:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1682, Unknown=17, NotChecked=616, Total=2450 [2023-11-29 06:45:10,336 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 37 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 31 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:45:15,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:45:20,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:45:26,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:45:30,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:45:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:45:33,790 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2023-11-29 06:45:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 06:45:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 31 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-11-29 06:45:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:45:33,791 INFO L225 Difference]: With dead ends: 49 [2023-11-29 06:45:33,791 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 06:45:33,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 69.6s TimeCoverageRelationStatistics Valid=231, Invalid=2536, Unknown=17, NotChecked=756, Total=3540 [2023-11-29 06:45:33,791 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:45:33,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 314 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 843 Invalid, 4 Unknown, 0 Unchecked, 18.3s Time] [2023-11-29 06:45:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 06:45:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 06:45:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:45:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 06:45:33,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2023-11-29 06:45:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:45:33,792 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 06:45:33,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 31 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 06:45:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 06:45:33,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 06:45:33,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2023-11-29 06:45:33,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2023-11-29 06:45:33,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (11 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (10 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (9 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (8 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (7 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (6 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (5 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (4 of 28 remaining) [2023-11-29 06:45:33,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2023-11-29 06:45:33,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2023-11-29 06:45:33,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2023-11-29 06:45:33,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 28 remaining) [2023-11-29 06:45:33,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 06:45:33,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 06:45:34,002 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:45:34,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:45:34,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:45:34 BoogieIcfgContainer [2023-11-29 06:45:34,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:45:34,006 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:45:34,006 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:45:34,006 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:45:34,006 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:46" (3/4) ... [2023-11-29 06:45:34,008 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 06:45:34,010 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-29 06:45:34,015 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-11-29 06:45:34,015 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 06:45:34,015 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 06:45:34,016 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 06:45:34,097 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:45:34,097 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 06:45:34,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:45:34,097 INFO L158 Benchmark]: Toolchain (without parser) took 168681.10ms. Allocated memory was 134.2MB in the beginning and 373.3MB in the end (delta: 239.1MB). Free memory was 71.4MB in the beginning and 233.4MB in the end (delta: -161.9MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,098 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:45:34,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.67ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 71.1MB in the beginning and 139.9MB in the end (delta: -68.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.54ms. Allocated memory is still 178.3MB. Free memory was 139.1MB in the beginning and 137.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,098 INFO L158 Benchmark]: Boogie Preprocessor took 69.77ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 134.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,099 INFO L158 Benchmark]: RCFGBuilder took 597.13ms. Allocated memory is still 178.3MB. Free memory was 134.5MB in the beginning and 110.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,099 INFO L158 Benchmark]: TraceAbstraction took 167410.36ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 109.7MB in the beginning and 239.2MB in the end (delta: -129.5MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,099 INFO L158 Benchmark]: Witness Printer took 91.03ms. Allocated memory is still 373.3MB. Free memory was 239.2MB in the beginning and 233.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 06:45:34,100 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.67ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 71.1MB in the beginning and 139.9MB in the end (delta: -68.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.54ms. Allocated memory is still 178.3MB. Free memory was 139.1MB in the beginning and 137.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.77ms. Allocated memory is still 178.3MB. Free memory was 137.0MB in the beginning and 134.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 597.13ms. Allocated memory is still 178.3MB. Free memory was 134.5MB in the beginning and 110.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 167410.36ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 109.7MB in the beginning and 239.2MB in the end (delta: -129.5MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 91.03ms. Allocated memory is still 373.3MB. Free memory was 239.2MB in the beginning and 233.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 167.3s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2830 SdHoareTripleChecker+Valid, 27.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2829 mSDsluCounter, 13227 SdHoareTripleChecker+Invalid, 25.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 497 IncrementalHoareTripleChecker+Unchecked, 11810 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14799 IncrementalHoareTripleChecker+Invalid, 15444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 1417 mSDtfsCounter, 14799 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2148 GetRequests, 1206 SyntacticMatches, 36 SemanticMatches, 906 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 6677 ImplicationChecksByTransitivity, 100.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=16, InterpolantAutomatonStates: 418, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 316 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 117.1s InterpolantComputationTime, 2076 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 2448 ConstructedInterpolants, 103 QuantifiedInterpolants, 23197 SizeOfPredicates, 254 NumberOfNonLiveVariables, 7974 ConjunctsInSsa, 1153 ConjunctsInUnsatCore, 73 InterpolantComputations, 17 PerfectInterpolantSequences, 689/1083 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 06:45:34,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10f11f91-d4e6-4722-816f-450c4ee4e6bc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE