./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI --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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:41:13,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:41:13,761 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:41:13,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:41:13,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:41:13,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:41:13,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:41:13,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:41:13,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:41:13,828 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:41:13,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:41:13,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:41:13,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:41:13,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:41:13,830 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:41:13,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:41:13,831 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:41:13,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:41:13,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:41:13,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:41:13,833 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:41:13,836 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:41:13,837 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:41:13,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:41:13,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:41:13,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:41:13,838 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:41:13,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:41:13,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:41:13,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:41:13,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:41:13,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:41:13,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:13,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:41:13,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:41:13,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:41:13,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:41:13,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:41:13,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:41:13,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:41:13,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:41:13,844 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_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/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_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2023-11-24 21:41:14,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:41:14,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:41:14,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:41:14,134 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:41:14,134 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:41:14,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2023-11-24 21:41:17,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:41:17,612 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:41:17,612 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2023-11-24 21:41:17,627 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/data/ed0ca0266/4a1a93dfefe04f93a440c2fa4fd2d465/FLAG94611c168 [2023-11-24 21:41:17,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/data/ed0ca0266/4a1a93dfefe04f93a440c2fa4fd2d465 [2023-11-24 21:41:17,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:41:17,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:41:17,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:17,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:41:17,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:41:17,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:17" (1/1) ... [2023-11-24 21:41:17,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0c14fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:17, skipping insertion in model container [2023-11-24 21:41:17,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:17" (1/1) ... [2023-11-24 21:41:17,728 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:41:18,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:18,091 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:41:18,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:18,207 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:41:18,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18 WrapperNode [2023-11-24 21:41:18,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:18,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:18,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:41:18,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:41:18,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,282 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2023-11-24 21:41:18,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:18,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:41:18,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:41:18,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:41:18,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,319 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2023-11-24 21:41:18,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:41:18,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:41:18,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:41:18,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:41:18,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (1/1) ... [2023-11-24 21:41:18,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:18,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:18,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:41:18,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:41:18,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:41:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:41:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:41:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-24 21:41:18,414 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-24 21:41:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:41:18,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:41:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:41:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:41:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:41:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-24 21:41:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:41:18,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:41:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-24 21:41:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:41:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-24 21:41:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-24 21:41:18,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-24 21:41:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:41:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:41:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:41:18,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:41:18,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:41:18,560 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:41:18,562 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:41:18,916 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:41:18,975 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:41:18,975 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 21:41:18,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:18 BoogieIcfgContainer [2023-11-24 21:41:18,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:41:18,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:41:18,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:41:18,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:41:18,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:41:17" (1/3) ... [2023-11-24 21:41:18,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f9e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:18, skipping insertion in model container [2023-11-24 21:41:18,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:18" (2/3) ... [2023-11-24 21:41:18,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f9e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:18, skipping insertion in model container [2023-11-24 21:41:18,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:18" (3/3) ... [2023-11-24 21:41:18,987 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2023-11-24 21:41:19,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:41:19,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-24 21:41:19,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:41:19,065 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;@2e8f3897, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:41:19,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-24 21:41:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 40 states have (on average 2.35) internal successors, (94), 82 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 21:41:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-24 21:41:19,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:19,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:19,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:19,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 197185826, now seen corresponding path program 1 times [2023-11-24 21:41:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122060921] [2023-11-24 21:41:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:19,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:19,377 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-24 21:41:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:19,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122060921] [2023-11-24 21:41:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122060921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706007031] [2023-11-24 21:41:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:19,436 INFO L87 Difference]: Start difference. First operand has 86 states, 40 states have (on average 2.35) internal successors, (94), 82 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-24 21:41:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:19,591 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-11-24 21:41:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:19,594 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-24 21:41:19,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:19,603 INFO L225 Difference]: With dead ends: 83 [2023-11-24 21:41:19,603 INFO L226 Difference]: Without dead ends: 81 [2023-11-24 21:41:19,605 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-24 21:41:19,609 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:19,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 111 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:41:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-24 21:41:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-24 21:41:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 77 states have internal predecessors, (82), 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-24 21:41:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-11-24 21:41:19,653 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2023-11-24 21:41:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:19,653 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-11-24 21:41:19,654 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-24 21:41:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-11-24 21:41:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-24 21:41:19,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:19,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:19,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:41:19,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:19,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash 197185827, now seen corresponding path program 1 times [2023-11-24 21:41:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456005987] [2023-11-24 21:41:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:19,903 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-24 21:41:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456005987] [2023-11-24 21:41:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456005987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:19,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689092998] [2023-11-24 21:41:19,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:19,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:19,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:19,913 INFO L87 Difference]: Start difference. First operand 81 states and 86 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-24 21:41:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:20,039 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-24 21:41:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:20,039 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-24 21:41:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:20,043 INFO L225 Difference]: With dead ends: 79 [2023-11-24 21:41:20,044 INFO L226 Difference]: Without dead ends: 79 [2023-11-24 21:41:20,045 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-24 21:41:20,047 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:20,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:41:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-24 21:41:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-24 21:41:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 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-24 21:41:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-24 21:41:20,075 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 5 [2023-11-24 21:41:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:20,075 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-24 21:41:20,076 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-24 21:41:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-24 21:41:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:41:20,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:20,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:20,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:41:20,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:20,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash 868778784, now seen corresponding path program 1 times [2023-11-24 21:41:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:20,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352300551] [2023-11-24 21:41:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:20,256 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-24 21:41:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352300551] [2023-11-24 21:41:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352300551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:20,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043876565] [2023-11-24 21:41:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:20,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:20,270 INFO L87 Difference]: Start difference. First operand 79 states and 84 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-24 21:41:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:20,417 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-24 21:41:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:20,417 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-24 21:41:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:20,420 INFO L225 Difference]: With dead ends: 80 [2023-11-24 21:41:20,420 INFO L226 Difference]: Without dead ends: 80 [2023-11-24 21:41:20,423 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-24 21:41:20,425 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:20,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:41:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-24 21:41:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-24 21:41:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.076923076923077) internal successors, (81), 76 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-24 21:41:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-24 21:41:20,432 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 10 [2023-11-24 21:41:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:20,433 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-24 21:41:20,434 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-24 21:41:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-24 21:41:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 21:41:20,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:20,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:20,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:41:20,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:20,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash 603951037, now seen corresponding path program 1 times [2023-11-24 21:41:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808724252] [2023-11-24 21:41:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:20,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:20,823 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-24 21:41:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808724252] [2023-11-24 21:41:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808724252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:20,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:20,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247540470] [2023-11-24 21:41:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:20,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:20,829 INFO L87 Difference]: Start difference. First operand 80 states and 85 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-24 21:41:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:21,077 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-24 21:41:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:41:21,078 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-24 21:41:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:21,079 INFO L225 Difference]: With dead ends: 79 [2023-11-24 21:41:21,080 INFO L226 Difference]: Without dead ends: 79 [2023-11-24 21:41:21,080 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-24 21:41:21,081 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:21,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:41:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-24 21:41:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-24 21:41:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 2.051282051282051) internal successors, (80), 75 states have internal predecessors, (80), 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-24 21:41:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-24 21:41:21,092 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 17 [2023-11-24 21:41:21,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:21,092 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-24 21:41:21,093 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-24 21:41:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-24 21:41:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 21:41:21,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:21,094 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:41:21,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:21,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash 603951038, now seen corresponding path program 1 times [2023-11-24 21:41:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:21,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446848002] [2023-11-24 21:41:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:21,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:21,395 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-24 21:41:21,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:21,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446848002] [2023-11-24 21:41:21,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446848002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:21,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:21,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612607608] [2023-11-24 21:41:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:21,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:21,399 INFO L87 Difference]: Start difference. First operand 79 states and 84 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-24 21:41:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:21,609 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-24 21:41:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:41:21,610 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-24 21:41:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:21,611 INFO L225 Difference]: With dead ends: 78 [2023-11-24 21:41:21,611 INFO L226 Difference]: Without dead ends: 78 [2023-11-24 21:41:21,611 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-24 21:41:21,612 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:21,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 260 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:41:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-24 21:41:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-24 21:41:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 74 states have internal predecessors, (79), 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-24 21:41:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-24 21:41:21,619 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 17 [2023-11-24 21:41:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:21,619 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-24 21:41:21,620 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-24 21:41:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-24 21:41:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 21:41:21,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:21,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:21,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:41:21,621 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:21,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 576519566, now seen corresponding path program 1 times [2023-11-24 21:41:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687788735] [2023-11-24 21:41:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:21,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:22,031 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-24 21:41:22,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687788735] [2023-11-24 21:41:22,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687788735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861120678] [2023-11-24 21:41:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:22,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:22,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:22,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:22,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:41:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:22,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-24 21:41:22,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:22,237 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-24 21:41:22,324 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:41:22,325 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-24 21:41:22,383 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-24 21:41:22,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:22,683 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-24 21:41:22,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861120678] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:41:22,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:41:22,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-24 21:41:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668753282] [2023-11-24 21:41:22,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:22,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-24 21:41:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-24 21:41:22,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-24 21:41:22,687 INFO L87 Difference]: Start difference. First operand 78 states and 83 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-24 21:41:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:23,117 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2023-11-24 21:41:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:41:23,117 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-24 21:41:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:23,118 INFO L225 Difference]: With dead ends: 77 [2023-11-24 21:41:23,118 INFO L226 Difference]: Without dead ends: 77 [2023-11-24 21:41:23,119 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-24 21:41:23,120 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 5 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:23,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 437 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:41:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-24 21:41:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-24 21:41:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 2.0) internal successors, (78), 73 states have internal predecessors, (78), 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-24 21:41:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-24 21:41:23,126 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2023-11-24 21:41:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:23,126 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-24 21:41:23,127 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-24 21:41:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-24 21:41:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 21:41:23,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:23,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:23,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:23,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-24 21:41:23,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:23,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 576519567, now seen corresponding path program 1 times [2023-11-24 21:41:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753551632] [2023-11-24 21:41:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:23,795 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-24 21:41:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753551632] [2023-11-24 21:41:23,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753551632] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868845434] [2023-11-24 21:41:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:23,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:23,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:23,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:23,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:41:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:23,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-24 21:41:23,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:23,955 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-24 21:41:24,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:41:24,220 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-24 21:41:24,231 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-24 21:41:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:24,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868845434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:24,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:41:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-24 21:41:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294680279] [2023-11-24 21:41:24,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:24,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-24 21:41:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-24 21:41:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-24 21:41:24,454 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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-24 21:41:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:25,040 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-11-24 21:41:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:41:25,041 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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 19 [2023-11-24 21:41:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:25,042 INFO L225 Difference]: With dead ends: 78 [2023-11-24 21:41:25,042 INFO L226 Difference]: Without dead ends: 78 [2023-11-24 21:41:25,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2023-11-24 21:41:25,043 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:25,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 495 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-24 21:41:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-24 21:41:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-24 21:41:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 72 states have internal predecessors, (77), 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-24 21:41:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-24 21:41:25,049 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2023-11-24 21:41:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:25,050 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-24 21:41:25,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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-24 21:41:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-24 21:41:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:41:25,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:25,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:25,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 21:41:25,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 21:41:25,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:25,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -15332926, now seen corresponding path program 1 times [2023-11-24 21:41:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:25,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638327761] [2023-11-24 21:41:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:25,371 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-24 21:41:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:25,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638327761] [2023-11-24 21:41:25,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638327761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:25,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:25,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:25,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936183646] [2023-11-24 21:41:25,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:25,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:25,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:25,374 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-24 21:41:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:25,491 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2023-11-24 21:41:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:41:25,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2023-11-24 21:41:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:25,493 INFO L225 Difference]: With dead ends: 129 [2023-11-24 21:41:25,493 INFO L226 Difference]: Without dead ends: 129 [2023-11-24 21:41:25,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-24 21:41:25,494 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 121 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:25,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 157 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:41:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-24 21:41:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 77. [2023-11-24 21:41:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.95) internal successors, (78), 73 states have internal predecessors, (78), 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-24 21:41:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-24 21:41:25,500 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 21 [2023-11-24 21:41:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:25,500 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-24 21:41:25,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-24 21:41:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-24 21:41:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:41:25,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:25,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:25,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:41:25,502 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:25,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash -15332954, now seen corresponding path program 1 times [2023-11-24 21:41:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:25,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643369451] [2023-11-24 21:41:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:25,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:41:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643369451] [2023-11-24 21:41:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643369451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515756133] [2023-11-24 21:41:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:25,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:25,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:41:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:26,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-24 21:41:26,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:26,144 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-24 21:41:26,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-24 21:41:26,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:41:26,235 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-24 21:41:26,326 WARN L854 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))))) is different from false [2023-11-24 21:41:26,328 WARN L876 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))))) is different from true [2023-11-24 21:41:26,354 WARN L854 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2023-11-24 21:41:26,356 WARN L876 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from true [2023-11-24 21:41:26,391 WARN L854 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1))))) is different from false [2023-11-24 21:41:26,393 WARN L876 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1))))) is different from true [2023-11-24 21:41:26,454 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1))))) is different from false [2023-11-24 21:41:26,457 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1))))) is different from true [2023-11-24 21:41:26,487 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1))))) is different from false [2023-11-24 21:41:26,489 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1))))) is different from true [2023-11-24 21:41:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-24 21:41:26,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515756133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:41:47,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:41:47,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 29 [2023-11-24 21:41:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407393130] [2023-11-24 21:41:47,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:47,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-24 21:41:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-24 21:41:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=518, Unknown=15, NotChecked=260, Total=930 [2023-11-24 21:41:47,091 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 31 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-24 21:41:47,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))))) is different from false [2023-11-24 21:41:47,273 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))))))) is different from true [2023-11-24 21:41:47,278 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from false [2023-11-24 21:41:47,280 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))))) is different from true [2023-11-24 21:41:47,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-24 21:41:47,288 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-24 21:41:47,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from false [2023-11-24 21:41:47,296 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from true [2023-11-24 21:41:47,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from false [2023-11-24 21:41:47,305 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (<= (+ 2 |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_22|) 1)))))) is different from true [2023-11-24 21:41:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:47,931 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2023-11-24 21:41:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 21:41:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 21 [2023-11-24 21:41:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:47,933 INFO L225 Difference]: With dead ends: 123 [2023-11-24 21:41:47,933 INFO L226 Difference]: Without dead ends: 123 [2023-11-24 21:41:47,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=203, Invalid=742, Unknown=25, NotChecked=670, Total=1640 [2023-11-24 21:41:47,935 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 127 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 855 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:47,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 499 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 778 Invalid, 0 Unknown, 855 Unchecked, 0.7s Time] [2023-11-24 21:41:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-24 21:41:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2023-11-24 21:41:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.836734693877551) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 21:41:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2023-11-24 21:41:47,939 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 21 [2023-11-24 21:41:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:47,940 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2023-11-24 21:41:47,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 22 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-24 21:41:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2023-11-24 21:41:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:41:47,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:47,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:47,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:48,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-24 21:41:48,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:48,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash -15332953, now seen corresponding path program 1 times [2023-11-24 21:41:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977151212] [2023-11-24 21:41:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,959 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-24 21:41:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977151212] [2023-11-24 21:41:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977151212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731267245] [2023-11-24 21:41:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:48,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:48,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:48,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:41:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:49,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-24 21:41:49,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:49,161 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-24 21:41:49,200 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-24 21:41:49,239 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-24 21:41:49,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:41:49,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 21:41:49,319 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-24 21:41:49,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:41:49,370 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-24 21:41:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 21:41:49,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731267245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:49,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:41:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 16 [2023-11-24 21:41:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681101686] [2023-11-24 21:41:49,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:49,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 21:41:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 21:41:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2023-11-24 21:41:49,695 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 21:41:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:50,366 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2023-11-24 21:41:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:41:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-11-24 21:41:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:50,367 INFO L225 Difference]: With dead ends: 76 [2023-11-24 21:41:50,367 INFO L226 Difference]: Without dead ends: 76 [2023-11-24 21:41:50,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=579, Unknown=1, NotChecked=50, Total=756 [2023-11-24 21:41:50,369 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 252 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:50,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 152 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 335 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2023-11-24 21:41:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-24 21:41:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-24 21:41:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 71 states have internal predecessors, (79), 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-24 21:41:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-24 21:41:50,382 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2023-11-24 21:41:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:50,383 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-24 21:41:50,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-24 21:41:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-24 21:41:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 21:41:50,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:50,385 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-24 21:41:50,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:50,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-24 21:41:50,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:50,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -475317126, now seen corresponding path program 1 times [2023-11-24 21:41:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726598747] [2023-11-24 21:41:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,879 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-24 21:41:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726598747] [2023-11-24 21:41:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726598747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:41:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727579317] [2023-11-24 21:41:50,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:41:50,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:41:50,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:41:50,884 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-24 21:41:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:51,388 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-11-24 21:41:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:41:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-24 21:41:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:51,390 INFO L225 Difference]: With dead ends: 105 [2023-11-24 21:41:51,390 INFO L226 Difference]: Without dead ends: 105 [2023-11-24 21:41:51,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-24 21:41:51,391 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:51,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 198 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:41:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-24 21:41:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2023-11-24 21:41:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 70 states have internal predecessors, (78), 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-24 21:41:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-24 21:41:51,417 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 22 [2023-11-24 21:41:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:51,417 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-24 21:41:51,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-24 21:41:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-24 21:41:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-24 21:41:51,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:51,418 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-24 21:41:51,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:41:51,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:51,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash -475317125, now seen corresponding path program 1 times [2023-11-24 21:41:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:51,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035766614] [2023-11-24 21:41:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:51,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:51,903 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-24 21:41:51,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035766614] [2023-11-24 21:41:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035766614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:51,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:51,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:41:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750846613] [2023-11-24 21:41:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:51,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:41:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:51,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:41:51,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:41:51,908 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 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-24 21:41:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:52,550 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-11-24 21:41:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:41:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 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-24 21:41:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:52,553 INFO L225 Difference]: With dead ends: 156 [2023-11-24 21:41:52,553 INFO L226 Difference]: Without dead ends: 156 [2023-11-24 21:41:52,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-24 21:41:52,554 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 197 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:52,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 290 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-24 21:41:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-24 21:41:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2023-11-24 21:41:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.6455696202531647) internal successors, (130), 99 states have internal predecessors, (130), 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-24 21:41:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2023-11-24 21:41:52,561 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 22 [2023-11-24 21:41:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:52,564 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2023-11-24 21:41:52,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 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-24 21:41:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2023-11-24 21:41:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 21:41:52,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:52,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:52,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:41:52,570 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:52,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1849929000, now seen corresponding path program 1 times [2023-11-24 21:41:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734174712] [2023-11-24 21:41:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:52,658 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-24 21:41:52,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:52,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734174712] [2023-11-24 21:41:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734174712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:52,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:52,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949742920] [2023-11-24 21:41:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:52,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:52,662 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-24 21:41:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:52,779 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2023-11-24 21:41:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2023-11-24 21:41:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:52,781 INFO L225 Difference]: With dead ends: 103 [2023-11-24 21:41:52,781 INFO L226 Difference]: Without dead ends: 103 [2023-11-24 21:41:52,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-24 21:41:52,782 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:52,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 79 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:41:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-24 21:41:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2023-11-24 21:41:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 90 states have internal predecessors, (120), 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-24 21:41:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2023-11-24 21:41:52,787 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 23 [2023-11-24 21:41:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:52,787 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2023-11-24 21:41:52,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-24 21:41:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2023-11-24 21:41:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:41:52,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:52,794 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] [2023-11-24 21:41:52,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:41:52,795 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:52,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1785531745, now seen corresponding path program 1 times [2023-11-24 21:41:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327436858] [2023-11-24 21:41:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:41:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327436858] [2023-11-24 21:41:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327436858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141433203] [2023-11-24 21:41:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:53,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:53,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 21:41:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-24 21:41:53,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:53,719 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-24 21:41:53,930 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:41:53,931 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-24 21:41:54,033 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-24 21:41:54,115 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-24 21:41:54,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-24 21:41:54,250 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 37 treesize of output 21 [2023-11-24 21:41:54,336 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-24 21:41:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:54,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:54,397 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 29 treesize of output 21 [2023-11-24 21:41:54,402 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 17 [2023-11-24 21:41:54,413 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-11-24 21:41:54,414 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-24 21:41:54,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_999) |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-24 21:41:54,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:41:54,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-24 21:41:54,436 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-24 21:41:54,443 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-24 21:41:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141433203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:54,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:41:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2023-11-24 21:41:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589353477] [2023-11-24 21:41:54,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:54,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-24 21:41:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-24 21:41:54,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=739, Unknown=1, NotChecked=54, Total=870 [2023-11-24 21:41:54,561 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 28 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 21:41:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:41:55,679 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2023-11-24 21:41:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 21:41:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-24 21:41:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:41:55,682 INFO L225 Difference]: With dead ends: 163 [2023-11-24 21:41:55,683 INFO L226 Difference]: Without dead ends: 163 [2023-11-24 21:41:55,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=1193, Unknown=1, NotChecked=70, Total=1406 [2023-11-24 21:41:55,685 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 436 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 21:41:55,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 346 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 21:41:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-24 21:41:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 106. [2023-11-24 21:41:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 101 states have internal predecessors, (134), 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-24 21:41:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2023-11-24 21:41:55,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 26 [2023-11-24 21:41:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:41:55,692 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 140 transitions. [2023-11-24 21:41:55,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.826086956521739) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 21:41:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2023-11-24 21:41:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:41:55,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:41:55,694 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] [2023-11-24 21:41:55,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 21:41:55,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:55,901 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:41:55,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1785531746, now seen corresponding path program 1 times [2023-11-24 21:41:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919635790] [2023-11-24 21:41:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:56,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:41:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:41:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:41:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919635790] [2023-11-24 21:41:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919635790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626087662] [2023-11-24 21:41:56,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:56,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:56,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 21:41:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:57,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-24 21:41:57,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:57,143 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-24 21:41:57,506 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:41:57,507 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-24 21:41:57,519 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-24 21:41:57,652 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-24 21:41:57,665 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-24 21:41:57,795 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-24 21:41:57,795 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 116 treesize of output 91 [2023-11-24 21:41:57,804 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 79 treesize of output 44 [2023-11-24 21:41:57,976 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 74 treesize of output 50 [2023-11-24 21:41:57,982 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 54 treesize of output 34 [2023-11-24 21:41:58,095 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-24 21:41:58,105 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-24 21:41:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:58,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:58,441 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 65 treesize of output 49 [2023-11-24 21:41:58,446 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 53 treesize of output 37 [2023-11-24 21:41:58,454 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1118 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_2) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1117 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1117) |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-24 21:41:58,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:41:58,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-24 21:41:58,483 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-24 21:41:58,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:41:58,501 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-24 21:41:58,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:41:58,511 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-24 21:41:58,513 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:41:58,516 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-24 21:41:58,519 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:41:58,521 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-24 21:41:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626087662] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:58,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 21:41:58,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2023-11-24 21:41:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703536157] [2023-11-24 21:41:58,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:58,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-24 21:41:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-24 21:41:58,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1308, Unknown=1, NotChecked=72, Total=1482 [2023-11-24 21:41:58,858 INFO L87 Difference]: Start difference. First operand 106 states and 140 transitions. Second operand has 31 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 21:42:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:42:01,115 INFO L93 Difference]: Finished difference Result 205 states and 247 transitions. [2023-11-24 21:42:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 21:42:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-24 21:42:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:42:01,117 INFO L225 Difference]: With dead ends: 205 [2023-11-24 21:42:01,117 INFO L226 Difference]: Without dead ends: 205 [2023-11-24 21:42:01,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=204, Invalid=2349, Unknown=1, NotChecked=98, Total=2652 [2023-11-24 21:42:01,121 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 685 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:42:01,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 747 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-24 21:42:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-24 21:42:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 105. [2023-11-24 21:42:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 100 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 21:42:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2023-11-24 21:42:01,127 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 26 [2023-11-24 21:42:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:42:01,127 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2023-11-24 21:42:01,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-24 21:42:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2023-11-24 21:42:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 21:42:01,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:42:01,128 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, 1] [2023-11-24 21:42:01,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:42:01,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-24 21:42:01,339 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:42:01,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2095995301, now seen corresponding path program 1 times [2023-11-24 21:42:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:01,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846434797] [2023-11-24 21:42:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:01,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:42:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:42:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,475 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-24 21:42:01,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846434797] [2023-11-24 21:42:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846434797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:42:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944487599] [2023-11-24 21:42:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:01,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:42:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:01,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:42:01,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:42:01,478 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-24 21:42:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:42:01,665 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2023-11-24 21:42:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:42:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 28 [2023-11-24 21:42:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:42:01,668 INFO L225 Difference]: With dead ends: 129 [2023-11-24 21:42:01,668 INFO L226 Difference]: Without dead ends: 129 [2023-11-24 21:42:01,668 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-24 21:42:01,669 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:42:01,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:42:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-24 21:42:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2023-11-24 21:42:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 108 states have internal predecessors, (144), 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-24 21:42:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2023-11-24 21:42:01,674 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 28 [2023-11-24 21:42:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:42:01,675 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2023-11-24 21:42:01,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-24 21:42:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2023-11-24 21:42:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 21:42:01,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:42:01,678 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, 1] [2023-11-24 21:42:01,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:42:01,679 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:42:01,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2096012154, now seen corresponding path program 1 times [2023-11-24 21:42:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:01,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755536423] [2023-11-24 21:42:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:42:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:42:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,973 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-24 21:42:01,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755536423] [2023-11-24 21:42:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755536423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:01,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:42:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635202320] [2023-11-24 21:42:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:01,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:42:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:01,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:42:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:42:01,977 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-24 21:42:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:42:02,330 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2023-11-24 21:42:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 21:42:02,331 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-24 21:42:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:42:02,333 INFO L225 Difference]: With dead ends: 112 [2023-11-24 21:42:02,333 INFO L226 Difference]: Without dead ends: 112 [2023-11-24 21:42:02,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-24 21:42:02,334 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 87 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 21:42:02,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 317 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 21:42:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-24 21:42:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-24 21:42:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 107 states have internal predecessors, (143), 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-24 21:42:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 149 transitions. [2023-11-24 21:42:02,343 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 149 transitions. Word has length 28 [2023-11-24 21:42:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:42:02,345 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 149 transitions. [2023-11-24 21:42:02,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-24 21:42:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2023-11-24 21:42:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 21:42:02,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:42:02,347 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, 1, 1] [2023-11-24 21:42:02,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:42:02,347 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:42:02,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash -551867229, now seen corresponding path program 1 times [2023-11-24 21:42:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031024233] [2023-11-24 21:42:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:42:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:42:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:02,686 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-24 21:42:02,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:02,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031024233] [2023-11-24 21:42:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031024233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:02,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:42:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685609339] [2023-11-24 21:42:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:02,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:42:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:42:02,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:42:02,690 INFO L87 Difference]: Start difference. First operand 112 states and 149 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-24 21:42:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:42:03,212 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2023-11-24 21:42:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 21:42:03,213 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2023-11-24 21:42:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:42:03,214 INFO L225 Difference]: With dead ends: 140 [2023-11-24 21:42:03,214 INFO L226 Difference]: Without dead ends: 140 [2023-11-24 21:42:03,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-11-24 21:42:03,215 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:42:03,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 359 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:42:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-24 21:42:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2023-11-24 21:42:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.574468085106383) internal successors, (148), 112 states have internal predecessors, (148), 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-24 21:42:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-11-24 21:42:03,222 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 29 [2023-11-24 21:42:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:42:03,222 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-11-24 21:42:03,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-24 21:42:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-11-24 21:42:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 21:42:03,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:42:03,224 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, 1, 1, 1] [2023-11-24 21:42:03,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:42:03,224 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:42:03,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 71985192, now seen corresponding path program 1 times [2023-11-24 21:42:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:03,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608365491] [2023-11-24 21:42:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:42:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:42:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:03,505 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-24 21:42:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608365491] [2023-11-24 21:42:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608365491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 21:42:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572172514] [2023-11-24 21:42:03,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:03,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:42:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:03,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:42:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:42:03,509 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-24 21:42:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:42:03,936 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2023-11-24 21:42:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:42:03,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-11-24 21:42:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:42:03,938 INFO L225 Difference]: With dead ends: 148 [2023-11-24 21:42:03,939 INFO L226 Difference]: Without dead ends: 148 [2023-11-24 21:42:03,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-24 21:42:03,939 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 21:42:03,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 266 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 21:42:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-24 21:42:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2023-11-24 21:42:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 127 states have internal predecessors, (169), 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-24 21:42:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2023-11-24 21:42:03,946 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 30 [2023-11-24 21:42:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:42:03,946 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2023-11-24 21:42:03,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-24 21:42:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2023-11-24 21:42:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-24 21:42:03,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:42:03,948 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, 1] [2023-11-24 21:42:03,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:42:03,948 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-24 21:42:03,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 679350984, now seen corresponding path program 2 times [2023-11-24 21:42:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074739459] [2023-11-24 21:42:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 21:42:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-24 21:42:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:42:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074739459] [2023-11-24 21:42:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074739459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:42:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216020201] [2023-11-24 21:42:04,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:42:04,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:42:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:42:04,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:42:04,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a18cca7a-01d4-4dc3-8e56-0f0b11f783ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 21:42:05,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:42:05,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:42:05,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-24 21:42:05,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:42:05,120 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-24 21:42:05,475 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 21:42:05,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-24 21:42:05,633 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-24 21:42:05,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 11 treesize of output 7 [2023-11-24 21:42:05,776 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-24 21:42:05,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 47 [2023-11-24 21:42:05,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-11-24 21:42:05,975 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 44 [2023-11-24 21:42:06,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 21:42:06,330 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 21:42:06,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 19 [2023-11-24 21:42:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:06,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:42:06,421 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 61 treesize of output 49 [2023-11-24 21:42:06,425 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 53 treesize of output 41 [2023-11-24 21:42:06,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1519 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (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|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1519) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) 1)) is different from false [2023-11-24 21:42:06,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:42:06,463 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 750 treesize of output 682 [2023-11-24 21:42:06,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:42:06,487 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 487 treesize of output 407 [2023-11-24 21:42:06,502 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 544 treesize of output 496 [2023-11-24 21:42:06,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 492 treesize of output 470