./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:06:50,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:06:50,912 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:06:50,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:06:50,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:06:50,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:06:50,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:06:50,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:06:50,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:06:50,942 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:06:50,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:06:50,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:06:50,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:06:50,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:06:50,945 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:06:50,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:06:50,946 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:06:50,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:06:50,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:06:50,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:06:50,948 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:06:50,950 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:06:50,951 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:06:50,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:06:50,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:06:50,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:06:50,952 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:06:50,953 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:06:50,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:06:50,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:06:50,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:06:50,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:06:50,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:06:50,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:06:50,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:06:50,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:06:50,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:06:50,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:06:50,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:06:50,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:06:50,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:06:50,956 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_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2023-11-29 05:06:51,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:06:51,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:06:51,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:06:51,202 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:06:51,202 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:06:51,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-29 05:06:54,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:06:54,237 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:06:54,237 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2023-11-29 05:06:54,252 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/data/1e27a471a/85abf0deee904ba797ca7528cf4446ac/FLAG9151818ba [2023-11-29 05:06:54,265 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/data/1e27a471a/85abf0deee904ba797ca7528cf4446ac [2023-11-29 05:06:54,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:06:54,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:06:54,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:06:54,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:06:54,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:06:54,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f1edc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54, skipping insertion in model container [2023-11-29 05:06:54,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,321 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:06:54,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:06:54,593 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:06:54,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:06:54,662 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:06:54,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54 WrapperNode [2023-11-29 05:06:54,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:06:54,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:06:54,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:06:54,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:06:54,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,715 INFO L138 Inliner]: procedures = 127, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 196 [2023-11-29 05:06:54,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:06:54,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:06:54,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:06:54,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:06:54,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,757 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2023-11-29 05:06:54,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:06:54,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:06:54,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:06:54,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:06:54,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (1/1) ... [2023-11-29 05:06:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:06:54,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:06:54,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:06:54,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:06:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:06:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:06:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:06:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:06:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:06:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:06:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:06:54,852 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:06:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:06:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:06:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:06:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:06:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:06:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:06:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:06:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:06:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:06:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:06:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:06:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:06:55,002 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:06:55,004 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:06:55,456 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:06:55,507 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:06:55,507 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 05:06:55,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:55 BoogieIcfgContainer [2023-11-29 05:06:55,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:06:55,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:06:55,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:06:55,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:06:55,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:06:54" (1/3) ... [2023-11-29 05:06:55,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403d5fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:06:55, skipping insertion in model container [2023-11-29 05:06:55,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:06:54" (2/3) ... [2023-11-29 05:06:55,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403d5fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:06:55, skipping insertion in model container [2023-11-29 05:06:55,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:06:55" (3/3) ... [2023-11-29 05:06:55,516 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2023-11-29 05:06:55,531 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:06:55,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 82 error locations. [2023-11-29 05:06:55,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:06:55,579 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;@c596de9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:06:55,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2023-11-29 05:06:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 71 states have (on average 2.436619718309859) internal successors, (173), 153 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:06:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:06:55,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:55,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:06:55,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:55,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash 314316090, now seen corresponding path program 1 times [2023-11-29 05:06:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360713616] [2023-11-29 05:06:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:55,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:06:55,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360713616] [2023-11-29 05:06:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360713616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:06:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468728055] [2023-11-29 05:06:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:55,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:06:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:06:55,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:06:55,843 INFO L87 Difference]: Start difference. First operand has 158 states, 71 states have (on average 2.436619718309859) internal successors, (173), 153 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:06:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:56,024 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2023-11-29 05:06:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:06:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 05:06:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:56,036 INFO L225 Difference]: With dead ends: 154 [2023-11-29 05:06:56,036 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 05:06:56,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:06:56,041 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:56,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 223 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:06:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 05:06:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-11-29 05:06:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 69 states have (on average 2.3043478260869565) internal successors, (159), 147 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:06:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2023-11-29 05:06:56,081 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 5 [2023-11-29 05:06:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:56,082 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2023-11-29 05:06:56,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:06:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2023-11-29 05:06:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:06:56,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:56,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:06:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:06:56,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:56,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash 314316091, now seen corresponding path program 1 times [2023-11-29 05:06:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:56,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835441251] [2023-11-29 05:06:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:06:56,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:56,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835441251] [2023-11-29 05:06:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835441251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:56,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:56,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:06:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400204581] [2023-11-29 05:06:56,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:56,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:06:56,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:56,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:06:56,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:06:56,199 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:06:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:56,345 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2023-11-29 05:06:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:06:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 05:06:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:56,348 INFO L225 Difference]: With dead ends: 149 [2023-11-29 05:06:56,348 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 05:06:56,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:06:56,350 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:56,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:06:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 05:06:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-11-29 05:06:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 69 states have (on average 2.260869565217391) internal successors, (156), 144 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:06:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2023-11-29 05:06:56,364 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 5 [2023-11-29 05:06:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:56,364 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2023-11-29 05:06:56,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:06:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2023-11-29 05:06:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:06:56,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:56,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:56,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:06:56,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:56,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1588858566, now seen corresponding path program 1 times [2023-11-29 05:06:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106775466] [2023-11-29 05:06:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:06:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:06:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:56,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106775466] [2023-11-29 05:06:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106775466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:56,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:06:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155399192] [2023-11-29 05:06:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:56,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:06:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:56,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:06:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:06:56,517 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:06:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:56,711 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2023-11-29 05:06:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:06:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 05:06:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:56,714 INFO L225 Difference]: With dead ends: 160 [2023-11-29 05:06:56,714 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 05:06:56,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:06:56,716 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 10 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:56,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 327 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:06:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 05:06:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 150. [2023-11-29 05:06:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 70 states have (on average 2.242857142857143) internal successors, (157), 145 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:06:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2023-11-29 05:06:56,729 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 11 [2023-11-29 05:06:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:56,729 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2023-11-29 05:06:56,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:06:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2023-11-29 05:06:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:06:56,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:56,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:56,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:06:56,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:56,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash -856336920, now seen corresponding path program 1 times [2023-11-29 05:06:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:56,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043375853] [2023-11-29 05:06:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:06:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:56,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:06:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:06:56,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043375853] [2023-11-29 05:06:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043375853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:56,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:56,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:06:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951783893] [2023-11-29 05:06:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:56,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:06:56,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:06:56,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:06:56,940 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:06:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:57,299 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2023-11-29 05:06:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:06:57,300 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 19 [2023-11-29 05:06:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:57,302 INFO L225 Difference]: With dead ends: 149 [2023-11-29 05:06:57,302 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 05:06:57,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:06:57,303 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 9 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:57,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 476 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:06:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 05:06:57,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-11-29 05:06:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 70 states have (on average 2.2285714285714286) internal successors, (156), 144 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:06:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2023-11-29 05:06:57,314 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 19 [2023-11-29 05:06:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:57,314 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2023-11-29 05:06:57,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:06:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2023-11-29 05:06:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:06:57,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:57,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:57,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:06:57,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:57,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:57,317 INFO L85 PathProgramCache]: Analyzing trace with hash -856336919, now seen corresponding path program 1 times [2023-11-29 05:06:57,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:57,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803514244] [2023-11-29 05:06:57,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:57,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:06:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:06:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:06:57,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803514244] [2023-11-29 05:06:57,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803514244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:06:57,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:06:57,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:06:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346583827] [2023-11-29 05:06:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:06:57,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:06:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:06:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:06:57,602 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:06:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:57,935 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2023-11-29 05:06:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:06:57,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2023-11-29 05:06:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:57,938 INFO L225 Difference]: With dead ends: 148 [2023-11-29 05:06:57,938 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 05:06:57,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:06:57,939 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 7 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:57,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 500 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:06:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 05:06:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-11-29 05:06:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 70 states have (on average 2.2142857142857144) internal successors, (155), 143 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:06:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2023-11-29 05:06:57,948 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 19 [2023-11-29 05:06:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:57,948 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2023-11-29 05:06:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:06:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2023-11-29 05:06:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:06:57,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:57,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:57,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:06:57,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:57,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1693940425, now seen corresponding path program 1 times [2023-11-29 05:06:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683265953] [2023-11-29 05:06:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:06:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:06:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:06:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:06:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683265953] [2023-11-29 05:06:58,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683265953] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:06:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048688953] [2023-11-29 05:06:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:06:58,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:06:58,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:06:58,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:06:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:58,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 05:06:58,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:58,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:06:58,510 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:06:58,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 05:06:58,563 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-29 05:06:58,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:06:58,862 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-29 05:06:58,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048688953] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:06:58,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:06:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-11-29 05:06:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282602514] [2023-11-29 05:06:58,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:06:58,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:06:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:06:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:06:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:06:58,865 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 19 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:06:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:59,567 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2023-11-29 05:06:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:06:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 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 21 [2023-11-29 05:06:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:59,569 INFO L225 Difference]: With dead ends: 155 [2023-11-29 05:06:59,569 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 05:06:59,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:06:59,571 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 15 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:59,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 918 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:06:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 05:06:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2023-11-29 05:06:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 74 states have (on average 2.175675675675676) internal successors, (161), 147 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:06:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2023-11-29 05:06:59,578 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 21 [2023-11-29 05:06:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:59,579 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2023-11-29 05:06:59,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:06:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2023-11-29 05:06:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:06:59,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:59,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:06:59,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:06:59,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:06:59,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:06:59,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1693940426, now seen corresponding path program 1 times [2023-11-29 05:06:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:06:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155502097] [2023-11-29 05:06:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:59,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:06:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:07:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155502097] [2023-11-29 05:07:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155502097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591001778] [2023-11-29 05:07:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:00,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:00,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:00,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:07:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:00,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 05:07:00,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:00,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:07:00,607 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:07:00,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 05:07:00,625 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:07:00,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:07:00,681 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-29 05:07:00,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591001778] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:00,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-29 05:07:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593897892] [2023-11-29 05:07:00,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:00,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:07:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:00,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:07:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:07:00,827 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:07:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:01,715 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2023-11-29 05:07:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:07:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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 21 [2023-11-29 05:07:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:01,717 INFO L225 Difference]: With dead ends: 155 [2023-11-29 05:07:01,717 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 05:07:01,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 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-29 05:07:01,718 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 6 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:01,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 836 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:07:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 05:07:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2023-11-29 05:07:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 74 states have (on average 2.1621621621621623) internal successors, (160), 147 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2023-11-29 05:07:01,725 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 21 [2023-11-29 05:07:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:01,725 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2023-11-29 05:07:01,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:07:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2023-11-29 05:07:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:07:01,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:01,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:01,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:07:01,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:01,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:01,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 84297375, now seen corresponding path program 1 times [2023-11-29 05:07:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315464018] [2023-11-29 05:07:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:07:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315464018] [2023-11-29 05:07:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315464018] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737821853] [2023-11-29 05:07:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:02,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:02,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:07:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:07:02,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:07:02,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:07:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737821853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:07:02,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:07:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-11-29 05:07:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781178293] [2023-11-29 05:07:02,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:02,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:07:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:07:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:07:02,272 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:07:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:02,487 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2023-11-29 05:07:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:02,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 05:07:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:02,489 INFO L225 Difference]: With dead ends: 154 [2023-11-29 05:07:02,489 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 05:07:02,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:07:02,490 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:02,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 715 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:07:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 05:07:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2023-11-29 05:07:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 74 states have (on average 2.1486486486486487) internal successors, (159), 147 states have internal predecessors, (159), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2023-11-29 05:07:02,495 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 23 [2023-11-29 05:07:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:02,495 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2023-11-29 05:07:02,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:07:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2023-11-29 05:07:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:07:02,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:02,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:02,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:07:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:02,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:02,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1686529334, now seen corresponding path program 1 times [2023-11-29 05:07:02,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:02,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540768684] [2023-11-29 05:07:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:07:02,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540768684] [2023-11-29 05:07:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540768684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298330467] [2023-11-29 05:07:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:02,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:02,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:02,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:02,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:07:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:07:02,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:07:02,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:03,007 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 05:07:03,008 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 12 treesize of output 11 [2023-11-29 05:07:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:07:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298330467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:07:03,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:07:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-11-29 05:07:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121380198] [2023-11-29 05:07:03,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:03,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:03,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:03,030 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:03,305 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2023-11-29 05:07:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-29 05:07:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:03,308 INFO L225 Difference]: With dead ends: 158 [2023-11-29 05:07:03,308 INFO L226 Difference]: Without dead ends: 158 [2023-11-29 05:07:03,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:07:03,309 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 6 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:03,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 468 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:07:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-29 05:07:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2023-11-29 05:07:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 150 states have internal predecessors, (164), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2023-11-29 05:07:03,315 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 24 [2023-11-29 05:07:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:03,316 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2023-11-29 05:07:03,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2023-11-29 05:07:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:07:03,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:03,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:03,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:07:03,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:03,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:03,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1686529333, now seen corresponding path program 1 times [2023-11-29 05:07:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:03,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011278142] [2023-11-29 05:07:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:03,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:03,723 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-29 05:07:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011278142] [2023-11-29 05:07:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011278142] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033365560] [2023-11-29 05:07:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:03,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:03,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:07:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:03,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 05:07:03,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:04,002 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-29 05:07:04,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:04,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:07:04,040 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 23 [2023-11-29 05:07:04,184 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-29 05:07:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033365560] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:07:04,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:07:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-11-29 05:07:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106703046] [2023-11-29 05:07:04,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:07:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:07:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:07:04,187 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:07:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:04,529 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2023-11-29 05:07:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:07:04,530 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-11-29 05:07:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:04,531 INFO L225 Difference]: With dead ends: 160 [2023-11-29 05:07:04,531 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 05:07:04,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:07:04,532 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 17 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:04,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1018 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:07:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 05:07:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2023-11-29 05:07:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 77 states have (on average 2.116883116883117) internal successors, (163), 150 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2023-11-29 05:07:04,538 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 24 [2023-11-29 05:07:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:04,538 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2023-11-29 05:07:04,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 05:07:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2023-11-29 05:07:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:07:04,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:04,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:04,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:07:04,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:04,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:04,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -742801797, now seen corresponding path program 1 times [2023-11-29 05:07:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036649757] [2023-11-29 05:07:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:07:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:04,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036649757] [2023-11-29 05:07:04,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036649757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:04,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:04,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:07:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230840637] [2023-11-29 05:07:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:04,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:07:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:07:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:07:04,907 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:07:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:05,277 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2023-11-29 05:07:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:07:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 05:07:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:05,279 INFO L225 Difference]: With dead ends: 156 [2023-11-29 05:07:05,279 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 05:07:05,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:07:05,280 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 9 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:05,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 545 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:07:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 05:07:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2023-11-29 05:07:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 77 states have (on average 2.103896103896104) internal successors, (162), 149 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2023-11-29 05:07:05,286 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 25 [2023-11-29 05:07:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:05,286 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2023-11-29 05:07:05,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:07:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2023-11-29 05:07:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:07:05,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:05,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:05,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:07:05,288 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:05,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -742801796, now seen corresponding path program 1 times [2023-11-29 05:07:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877768782] [2023-11-29 05:07:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:05,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:07:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877768782] [2023-11-29 05:07:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877768782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:07:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795601532] [2023-11-29 05:07:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:05,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:07:05,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:07:05,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:07:05,554 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:07:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:05,918 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2023-11-29 05:07:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:07:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-29 05:07:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:05,920 INFO L225 Difference]: With dead ends: 154 [2023-11-29 05:07:05,920 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 05:07:05,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:07:05,921 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 7 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:05,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 575 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:07:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 05:07:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-11-29 05:07:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 77 states have (on average 2.090909090909091) internal successors, (161), 148 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2023-11-29 05:07:05,926 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 25 [2023-11-29 05:07:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:05,927 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2023-11-29 05:07:05,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:07:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2023-11-29 05:07:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:07:05,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:05,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:05,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:07:05,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:05,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash 613033779, now seen corresponding path program 1 times [2023-11-29 05:07:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511842833] [2023-11-29 05:07:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:07:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511842833] [2023-11-29 05:07:06,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511842833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524209591] [2023-11-29 05:07:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:06,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:06,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:06,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:07:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:06,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:07:06,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:06,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:07:06,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:07:06,747 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:07:06,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 05:07:06,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-29 05:07:06,839 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:07:06,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-29 05:07:07,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:07:07,044 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|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-29 05:07:07,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:07:07,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:07:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2023-11-29 05:07:07,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524209591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:07,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:07,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2023-11-29 05:07:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832711037] [2023-11-29 05:07:07,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:07,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:07:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:07,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:07:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=317, Unknown=1, NotChecked=36, Total=420 [2023-11-29 05:07:07,156 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 20 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:07:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:07,636 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2023-11-29 05:07:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2023-11-29 05:07:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:07,638 INFO L225 Difference]: With dead ends: 160 [2023-11-29 05:07:07,638 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 05:07:07,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=415, Unknown=1, NotChecked=42, Total=552 [2023-11-29 05:07:07,639 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 733 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:07,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 437 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 642 Invalid, 0 Unknown, 160 Unchecked, 0.4s Time] [2023-11-29 05:07:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 05:07:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2023-11-29 05:07:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 77 states have (on average 1.948051948051948) internal successors, (150), 137 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2023-11-29 05:07:07,644 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 34 [2023-11-29 05:07:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:07,644 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2023-11-29 05:07:07,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:07:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2023-11-29 05:07:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:07:07,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:07,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:07,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:07:07,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:07:07,849 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:07,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:07,849 INFO L85 PathProgramCache]: Analyzing trace with hash 613033780, now seen corresponding path program 1 times [2023-11-29 05:07:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977810409] [2023-11-29 05:07:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977810409] [2023-11-29 05:07:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977810409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:07:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472852197] [2023-11-29 05:07:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:08,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:07:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:07:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:07:08,506 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 9 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:08,890 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2023-11-29 05:07:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-11-29 05:07:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:08,891 INFO L225 Difference]: With dead ends: 149 [2023-11-29 05:07:08,891 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 05:07:08,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:07:08,892 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 234 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:08,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 285 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:07:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 05:07:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2023-11-29 05:07:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 126 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:07:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2023-11-29 05:07:08,897 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 34 [2023-11-29 05:07:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:08,898 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2023-11-29 05:07:08,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2023-11-29 05:07:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:07:08,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:08,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:08,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:07:08,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:08,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 92958809, now seen corresponding path program 1 times [2023-11-29 05:07:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933980581] [2023-11-29 05:07:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:07:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:07:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933980581] [2023-11-29 05:07:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933980581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507511627] [2023-11-29 05:07:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:09,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:09,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:09,043 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:09,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:07:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:07:09,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:07:09,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:09,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507511627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:09,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:07:09,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-29 05:07:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447638833] [2023-11-29 05:07:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:07:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:09,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:07:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:09,291 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:09,336 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2023-11-29 05:07:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:07:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-29 05:07:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:09,337 INFO L225 Difference]: With dead ends: 120 [2023-11-29 05:07:09,337 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 05:07:09,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:09,338 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:09,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:07:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 05:07:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-29 05:07:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2023-11-29 05:07:09,343 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 34 [2023-11-29 05:07:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:09,343 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2023-11-29 05:07:09,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2023-11-29 05:07:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:07:09,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:09,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:09,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 05:07:09,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:09,545 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:09,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash 715181196, now seen corresponding path program 1 times [2023-11-29 05:07:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:09,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068903306] [2023-11-29 05:07:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:07:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068903306] [2023-11-29 05:07:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068903306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913337461] [2023-11-29 05:07:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:09,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:09,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:09,883 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:09,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:07:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:10,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 05:07:10,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:10,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:07:10,189 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-29 05:07:10,218 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-29 05:07:10,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 05:07:10,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 05:07:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:07:10,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913337461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:07:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2023-11-29 05:07:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428970310] [2023-11-29 05:07:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:10,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:07:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:10,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:07:10,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2023-11-29 05:07:10,254 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:10,543 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2023-11-29 05:07:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:07:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2023-11-29 05:07:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:10,545 INFO L225 Difference]: With dead ends: 162 [2023-11-29 05:07:10,545 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 05:07:10,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2023-11-29 05:07:10,546 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 129 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:10,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 418 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 214 Unchecked, 0.2s Time] [2023-11-29 05:07:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 05:07:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2023-11-29 05:07:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.844155844155844) internal successors, (142), 122 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2023-11-29 05:07:10,550 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 36 [2023-11-29 05:07:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:10,550 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2023-11-29 05:07:10,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2023-11-29 05:07:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:07:10,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:10,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:10,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:07:10,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 05:07:10,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:10,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 715181197, now seen corresponding path program 1 times [2023-11-29 05:07:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442878991] [2023-11-29 05:07:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:11,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:07:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442878991] [2023-11-29 05:07:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442878991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377154215] [2023-11-29 05:07:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:11,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:11,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:11,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:11,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:07:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:11,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 05:07:11,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:11,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-29 05:07:11,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:07:12,029 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int)) (<= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 0)))) is different from true [2023-11-29 05:07:12,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:07:12,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 05:07:12,076 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:07:12,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:07:12,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 05:07:12,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:07:12,136 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 33 treesize of output 25 [2023-11-29 05:07:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-29 05:07:12,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377154215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:12,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:12,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-11-29 05:07:12,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372540343] [2023-11-29 05:07:12,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:12,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:07:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:07:12,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=681, Unknown=1, NotChecked=52, Total=812 [2023-11-29 05:07:12,320 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 26 states, 20 states have (on average 2.8) internal successors, (56), 22 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:07:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:25,549 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2023-11-29 05:07:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:07:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.8) internal successors, (56), 22 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2023-11-29 05:07:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:25,551 INFO L225 Difference]: With dead ends: 167 [2023-11-29 05:07:25,551 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 05:07:25,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=169, Invalid=1391, Unknown=4, NotChecked=76, Total=1640 [2023-11-29 05:07:25,552 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 365 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:25,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 971 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1422 Invalid, 0 Unknown, 175 Unchecked, 0.9s Time] [2023-11-29 05:07:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 05:07:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2023-11-29 05:07:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 127 states have internal predecessors, (145), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2023-11-29 05:07:25,557 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 36 [2023-11-29 05:07:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:25,558 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2023-11-29 05:07:25,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.8) internal successors, (56), 22 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:07:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2023-11-29 05:07:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 05:07:25,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:25,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:25,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:07:25,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 05:07:25,759 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:25,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash 695778989, now seen corresponding path program 1 times [2023-11-29 05:07:25,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:25,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206943666] [2023-11-29 05:07:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:25,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:25,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206943666] [2023-11-29 05:07:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206943666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:25,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:25,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:07:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414095477] [2023-11-29 05:07:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:25,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:07:25,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:07:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:07:25,851 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:25,982 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2023-11-29 05:07:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:07:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2023-11-29 05:07:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:25,984 INFO L225 Difference]: With dead ends: 130 [2023-11-29 05:07:25,984 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 05:07:25,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:07:25,985 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 27 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:25,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 240 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:07:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 05:07:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-11-29 05:07:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 123 states have internal predecessors, (134), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2023-11-29 05:07:25,989 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 37 [2023-11-29 05:07:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:25,990 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2023-11-29 05:07:25,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2023-11-29 05:07:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:07:25,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:25,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:25,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:07:25,990 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:25,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash 94589593, now seen corresponding path program 1 times [2023-11-29 05:07:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112886689] [2023-11-29 05:07:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:26,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112886689] [2023-11-29 05:07:26,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112886689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:26,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:26,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801761402] [2023-11-29 05:07:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:26,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:26,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:26,169 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:26,318 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2023-11-29 05:07:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2023-11-29 05:07:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:26,320 INFO L225 Difference]: With dead ends: 126 [2023-11-29 05:07:26,320 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 05:07:26,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:07:26,321 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 189 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:26,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 225 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:07:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 05:07:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-29 05:07:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 120 states have internal predecessors, (130), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-11-29 05:07:26,325 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 38 [2023-11-29 05:07:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:26,326 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-11-29 05:07:26,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-11-29 05:07:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 05:07:26,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:26,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:26,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:07:26,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:26,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1370856498, now seen corresponding path program 1 times [2023-11-29 05:07:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:26,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372002461] [2023-11-29 05:07:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:07:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:26,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372002461] [2023-11-29 05:07:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372002461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483977716] [2023-11-29 05:07:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:26,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:07:26,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:07:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:07:26,462 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:26,705 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2023-11-29 05:07:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-11-29 05:07:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:26,707 INFO L225 Difference]: With dead ends: 120 [2023-11-29 05:07:26,707 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 05:07:26,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:07:26,708 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 35 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:26,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 328 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:07:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 05:07:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-29 05:07:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2023-11-29 05:07:26,713 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 39 [2023-11-29 05:07:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:26,713 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2023-11-29 05:07:26,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2023-11-29 05:07:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 05:07:26,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:26,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:26,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:07:26,714 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:26,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1370856497, now seen corresponding path program 1 times [2023-11-29 05:07:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47932457] [2023-11-29 05:07:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47932457] [2023-11-29 05:07:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47932457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:07:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239912815] [2023-11-29 05:07:26,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:26,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:07:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:26,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:07:26,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:26,882 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:27,015 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2023-11-29 05:07:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:07:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-11-29 05:07:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:27,016 INFO L225 Difference]: With dead ends: 119 [2023-11-29 05:07:27,016 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 05:07:27,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:27,017 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 103 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:27,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 250 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:07:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 05:07:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 05:07:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.605263157894737) internal successors, (122), 113 states have internal predecessors, (122), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2023-11-29 05:07:27,022 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 39 [2023-11-29 05:07:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:27,022 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2023-11-29 05:07:27,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2023-11-29 05:07:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 05:07:27,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:27,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:27,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:07:27,023 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:27,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1362691520, now seen corresponding path program 1 times [2023-11-29 05:07:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:27,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283341428] [2023-11-29 05:07:27,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283341428] [2023-11-29 05:07:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283341428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:07:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916359254] [2023-11-29 05:07:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:07:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:07:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:27,124 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:27,289 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2023-11-29 05:07:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-11-29 05:07:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:27,292 INFO L225 Difference]: With dead ends: 119 [2023-11-29 05:07:27,292 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 05:07:27,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:27,293 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 32 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:27,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 237 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:07:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 05:07:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2023-11-29 05:07:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 112 states have internal predecessors, (121), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2023-11-29 05:07:27,297 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 39 [2023-11-29 05:07:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:27,298 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2023-11-29 05:07:27,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2023-11-29 05:07:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 05:07:27,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:27,299 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:27,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:07:27,299 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:27,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1362691519, now seen corresponding path program 1 times [2023-11-29 05:07:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562498635] [2023-11-29 05:07:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562498635] [2023-11-29 05:07:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562498635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:27,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:27,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:07:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242896871] [2023-11-29 05:07:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:27,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:07:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:07:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:27,465 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:27,625 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2023-11-29 05:07:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:07:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-11-29 05:07:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:27,626 INFO L225 Difference]: With dead ends: 117 [2023-11-29 05:07:27,626 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 05:07:27,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:27,627 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 31 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:27,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 237 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:07:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 05:07:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-29 05:07:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 111 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2023-11-29 05:07:27,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 39 [2023-11-29 05:07:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:27,631 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2023-11-29 05:07:27,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2023-11-29 05:07:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 05:07:27,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:27,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:27,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:07:27,632 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:27,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash 706235880, now seen corresponding path program 1 times [2023-11-29 05:07:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:27,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181366634] [2023-11-29 05:07:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:07:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181366634] [2023-11-29 05:07:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181366634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:27,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970127752] [2023-11-29 05:07:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:27,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:07:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:07:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:07:27,861 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:28,077 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2023-11-29 05:07:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-11-29 05:07:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:28,078 INFO L225 Difference]: With dead ends: 111 [2023-11-29 05:07:28,079 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 05:07:28,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:07:28,079 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:28,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 348 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:07:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 05:07:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 05:07:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.5) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2023-11-29 05:07:28,084 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 40 [2023-11-29 05:07:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:28,084 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2023-11-29 05:07:28,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:07:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2023-11-29 05:07:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 05:07:28,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:28,085 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:28,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:07:28,086 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:28,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash 87848298, now seen corresponding path program 1 times [2023-11-29 05:07:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:28,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962496805] [2023-11-29 05:07:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:28,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:07:29,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962496805] [2023-11-29 05:07:29,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962496805] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500233298] [2023-11-29 05:07:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:29,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:29,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:29,270 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:29,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:07:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:29,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-29 05:07:29,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:29,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:07:29,720 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:07:29,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:07:29,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:07:29,876 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:07:29,876 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 32 treesize of output 31 [2023-11-29 05:07:29,985 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:07:29,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:07:30,048 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 57 treesize of output 25 [2023-11-29 05:07:30,102 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 14 [2023-11-29 05:07:30,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:07:30,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:07:30,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-29 05:07:30,406 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-11-29 05:07:30,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-11-29 05:07:30,591 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 66 treesize of output 38 [2023-11-29 05:07:30,675 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 33 treesize of output 17 [2023-11-29 05:07:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:07:30,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500233298] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:31,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 43 [2023-11-29 05:07:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605455584] [2023-11-29 05:07:31,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:31,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 05:07:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 05:07:31,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2188, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 05:07:31,154 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 44 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:07:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:32,939 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2023-11-29 05:07:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:07:32,940 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-11-29 05:07:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:32,941 INFO L225 Difference]: With dead ends: 111 [2023-11-29 05:07:32,941 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 05:07:32,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=4188, Unknown=0, NotChecked=0, Total=4556 [2023-11-29 05:07:32,942 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 185 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:32,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1302 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:07:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 05:07:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2023-11-29 05:07:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.486842105263158) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2023-11-29 05:07:32,945 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 42 [2023-11-29 05:07:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:32,945 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2023-11-29 05:07:32,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:07:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2023-11-29 05:07:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 05:07:32,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:32,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:32,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:07:33,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:33,147 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:33,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash 87848299, now seen corresponding path program 1 times [2023-11-29 05:07:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929009119] [2023-11-29 05:07:33,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:07:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929009119] [2023-11-29 05:07:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929009119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129491970] [2023-11-29 05:07:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:34,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:34,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:34,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:34,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:07:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:35,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 05:07:35,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:35,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:07:35,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:07:35,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:07:35,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:07:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:07:35,751 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:07:35,751 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 63 treesize of output 56 [2023-11-29 05:07:35,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2023-11-29 05:07:35,926 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:07:35,927 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 65 treesize of output 58 [2023-11-29 05:07:35,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2023-11-29 05:07:36,018 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 80 treesize of output 40 [2023-11-29 05:07:36,024 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 62 treesize of output 30 [2023-11-29 05:07:36,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2023-11-29 05:07:36,108 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 11 [2023-11-29 05:07:36,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:07:36,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:07:36,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:07:36,434 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 61 treesize of output 44 [2023-11-29 05:07:36,447 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:07:36,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:07:36,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2023-11-29 05:07:36,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 05:07:36,631 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 58 treesize of output 34 [2023-11-29 05:07:36,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-29 05:07:36,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-29 05:07:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:07:36,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129491970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:37,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2023-11-29 05:07:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292712982] [2023-11-29 05:07:37,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:37,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-29 05:07:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-29 05:07:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 05:07:37,208 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 47 states, 37 states have (on average 1.945945945945946) internal successors, (72), 39 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:07:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:40,041 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-11-29 05:07:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:07:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.945945945945946) internal successors, (72), 39 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-11-29 05:07:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:40,043 INFO L225 Difference]: With dead ends: 109 [2023-11-29 05:07:40,043 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 05:07:40,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=339, Invalid=4631, Unknown=0, NotChecked=0, Total=4970 [2023-11-29 05:07:40,045 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 161 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:40,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1649 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 05:07:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 05:07:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 05:07:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2023-11-29 05:07:40,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 42 [2023-11-29 05:07:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:40,049 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2023-11-29 05:07:40,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.945945945945946) internal successors, (72), 39 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:07:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2023-11-29 05:07:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:07:40,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:40,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:40,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:07:40,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 05:07:40,250 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:40,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1453664239, now seen corresponding path program 1 times [2023-11-29 05:07:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845331191] [2023-11-29 05:07:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:40,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:07:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845331191] [2023-11-29 05:07:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845331191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751790290] [2023-11-29 05:07:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:40,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:40,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:40,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:07:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:40,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 05:07:40,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:40,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:07:40,798 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:07:40,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 05:07:40,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 05:07:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 05:07:40,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751790290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:40,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:07:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 13 [2023-11-29 05:07:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416578637] [2023-11-29 05:07:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:40,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:07:40,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:40,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:07:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:07:40,871 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:41,237 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2023-11-29 05:07:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:07:41,238 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2023-11-29 05:07:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:41,239 INFO L225 Difference]: With dead ends: 167 [2023-11-29 05:07:41,239 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 05:07:41,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:07:41,239 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 102 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:41,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 442 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:07:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 05:07:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 109. [2023-11-29 05:07:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:07:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2023-11-29 05:07:41,242 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 45 [2023-11-29 05:07:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:41,242 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2023-11-29 05:07:41,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:07:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2023-11-29 05:07:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:07:41,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:41,243 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:41,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:07:41,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 05:07:41,444 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:07:41,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1453664240, now seen corresponding path program 1 times [2023-11-29 05:07:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945637419] [2023-11-29 05:07:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:07:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:07:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:07:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:07:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945637419] [2023-11-29 05:07:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945637419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611431001] [2023-11-29 05:07:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:07:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:42,234 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:07:42,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:07:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:42,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 05:07:42,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:42,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-29 05:07:42,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:07:46,858 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:07:46,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:07:46,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-29 05:07:47,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 05:07:47,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:07:47,174 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 37 treesize of output 29 [2023-11-29 05:07:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:07:47,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611431001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:47,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-11-29 05:07:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15613908] [2023-11-29 05:07:47,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:47,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 05:07:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 05:07:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1078, Unknown=1, NotChecked=0, Total=1190 [2023-11-29 05:07:47,412 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 32 states, 25 states have (on average 2.8) internal successors, (70), 27 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:07:51,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:07:59,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:03,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:07,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:11,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:15,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:08:28,804 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2023-11-29 05:08:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:08:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 2.8) internal successors, (70), 27 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2023-11-29 05:08:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:08:28,805 INFO L225 Difference]: With dead ends: 164 [2023-11-29 05:08:28,805 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 05:08:28,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=258, Invalid=2287, Unknown=5, NotChecked=0, Total=2550 [2023-11-29 05:08:28,807 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 359 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 5 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:08:28,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 934 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1394 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2023-11-29 05:08:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 05:08:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 111. [2023-11-29 05:08:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 105 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:08:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2023-11-29 05:08:28,811 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 45 [2023-11-29 05:08:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:08:28,811 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2023-11-29 05:08:28,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 2.8) internal successors, (70), 27 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:08:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2023-11-29 05:08:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 05:08:28,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:08:28,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:08:28,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:08:29,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 05:08:29,012 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:08:29,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:08:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 384431604, now seen corresponding path program 1 times [2023-11-29 05:08:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:08:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031108712] [2023-11-29 05:08:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:08:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:08:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:08:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:08:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:08:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:08:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:08:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031108712] [2023-11-29 05:08:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031108712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:08:29,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:08:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:08:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025429833] [2023-11-29 05:08:29,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:08:29,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:08:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:08:29,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:08:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:08:29,311 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:08:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:08:29,688 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2023-11-29 05:08:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:08:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2023-11-29 05:08:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:08:29,689 INFO L225 Difference]: With dead ends: 170 [2023-11-29 05:08:29,689 INFO L226 Difference]: Without dead ends: 170 [2023-11-29 05:08:29,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:08:29,690 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 94 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:08:29,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 673 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:08:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-29 05:08:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 112. [2023-11-29 05:08:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 106 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:08:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2023-11-29 05:08:29,693 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2023-11-29 05:08:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:08:29,693 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2023-11-29 05:08:29,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:08:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2023-11-29 05:08:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 05:08:29,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:08:29,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:08:29,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:08:29,694 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:08:29,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:08:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash 384431605, now seen corresponding path program 1 times [2023-11-29 05:08:29,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:08:29,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541962426] [2023-11-29 05:08:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:08:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:08:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:08:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:08:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:08:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:08:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:08:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541962426] [2023-11-29 05:08:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541962426] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:08:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099535972] [2023-11-29 05:08:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:08:29,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:08:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:08:29,952 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:08:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:08:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:30,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 05:08:30,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:08:30,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 05:08:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:08:30,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:08:30,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 8 treesize of output 4 [2023-11-29 05:08:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:08:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099535972] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:08:30,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:08:30,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 20 [2023-11-29 05:08:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266535287] [2023-11-29 05:08:30,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:08:30,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:08:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:08:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:08:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:08:30,449 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 17 states have internal predecessors, (62), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 05:08:34,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:38,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:42,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:46,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:50,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:54,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:08:58,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:09:02,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:09:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:02,841 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-11-29 05:09:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:09:02,841 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 17 states have internal predecessors, (62), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2023-11-29 05:09:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:02,842 INFO L225 Difference]: With dead ends: 92 [2023-11-29 05:09:02,842 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 05:09:02,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:09:02,843 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 161 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:02,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 884 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 519 Invalid, 8 Unknown, 0 Unchecked, 32.3s Time] [2023-11-29 05:09:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 05:09:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 05:09:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:09:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-11-29 05:09:02,846 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 46 [2023-11-29 05:09:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:02,847 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-11-29 05:09:02,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 17 states have internal predecessors, (62), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 05:09:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-11-29 05:09:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:09:02,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:02,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:02,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 05:09:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:03,048 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:09:03,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1357454438, now seen corresponding path program 1 times [2023-11-29 05:09:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851240922] [2023-11-29 05:09:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:09:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:09:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:09:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:09:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851240922] [2023-11-29 05:09:05,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851240922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053852366] [2023-11-29 05:09:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:09:05,153 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:09:05,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:09:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:05,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-29 05:09:05,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:05,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:09:05,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:09:05,713 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:09:05,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:09:05,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:09:05,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:09:05,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:05,952 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 48 treesize of output 43 [2023-11-29 05:09:05,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:09:06,140 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:06,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 05:09:06,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:09:06,219 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 44 treesize of output 20 [2023-11-29 05:09:06,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-29 05:09:06,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-29 05:09:06,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 9 treesize of output 3 [2023-11-29 05:09:06,322 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 11 treesize of output 3 [2023-11-29 05:09:06,687 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:09:06,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2023-11-29 05:09:06,692 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 10 treesize of output 8 [2023-11-29 05:09:06,711 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 05:09:06,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 05:09:06,736 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:09:06,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 05:09:07,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:07,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 05:09:07,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-29 05:09:07,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:09:07,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:09:07,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:09:07,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:09:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:07,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053852366] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:13,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:09:13,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 58 [2023-11-29 05:09:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973473661] [2023-11-29 05:09:13,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:09:13,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-29 05:09:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-29 05:09:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4143, Unknown=29, NotChecked=0, Total=4422 [2023-11-29 05:09:13,044 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 58 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:09:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:15,215 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2023-11-29 05:09:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 05:09:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2023-11-29 05:09:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:15,216 INFO L225 Difference]: With dead ends: 92 [2023-11-29 05:09:15,217 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 05:09:15,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=424, Invalid=6519, Unknown=29, NotChecked=0, Total=6972 [2023-11-29 05:09:15,219 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:15,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1548 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:09:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 05:09:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 05:09:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:09:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2023-11-29 05:09:15,222 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 49 [2023-11-29 05:09:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:15,222 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2023-11-29 05:09:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:09:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2023-11-29 05:09:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:09:15,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:15,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:15,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-29 05:09:15,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 05:09:15,424 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:09:15,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 871699926, now seen corresponding path program 1 times [2023-11-29 05:09:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330015300] [2023-11-29 05:09:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:16,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:09:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:09:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:16,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:09:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:09:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330015300] [2023-11-29 05:09:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330015300] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289996052] [2023-11-29 05:09:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:09:17,112 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:09:17,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:09:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:17,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-29 05:09:17,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:17,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:09:17,734 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:09:17,734 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-29 05:09:17,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:09:18,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:18,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 05:09:18,211 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 05:09:18,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 05:09:18,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2023-11-29 05:09:18,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-11-29 05:09:18,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:09:18,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:18,707 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 57 treesize of output 34 [2023-11-29 05:09:18,728 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:09:18,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:09:19,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 41 [2023-11-29 05:09:19,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2023-11-29 05:09:19,786 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:09:19,786 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 52 [2023-11-29 05:09:19,934 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:09:19,934 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 90 treesize of output 59 [2023-11-29 05:09:20,056 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 73 treesize of output 41 [2023-11-29 05:09:20,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:20,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2023-11-29 05:09:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:20,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:20,627 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2023-11-29 05:09:20,627 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 26 treesize of output 25 [2023-11-29 05:09:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289996052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:21,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:09:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 56 [2023-11-29 05:09:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975559332] [2023-11-29 05:09:21,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:09:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-29 05:09:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-29 05:09:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=4325, Unknown=8, NotChecked=0, Total=4556 [2023-11-29 05:09:21,675 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 57 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 48 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:09:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:24,969 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2023-11-29 05:09:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:09:24,970 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 48 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2023-11-29 05:09:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:24,971 INFO L225 Difference]: With dead ends: 119 [2023-11-29 05:09:24,971 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 05:09:24,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=419, Invalid=6545, Unknown=8, NotChecked=0, Total=6972 [2023-11-29 05:09:24,973 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 272 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:24,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1173 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 05:09:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 05:09:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2023-11-29 05:09:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:09:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2023-11-29 05:09:24,976 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 50 [2023-11-29 05:09:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:24,976 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2023-11-29 05:09:24,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 48 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:09:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2023-11-29 05:09:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:09:24,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:24,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:24,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:09:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-29 05:09:25,177 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:09:25,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash 871699927, now seen corresponding path program 1 times [2023-11-29 05:09:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334969826] [2023-11-29 05:09:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:09:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:26,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:09:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:26,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:09:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:09:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334969826] [2023-11-29 05:09:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334969826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748318720] [2023-11-29 05:09:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:26,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:26,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:09:26,771 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:09:26,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:09:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:27,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 05:09:27,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:27,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 6 treesize of output 5 [2023-11-29 05:09:27,409 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:09:27,409 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-29 05:09:27,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:09:27,645 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:27,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 05:09:27,828 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:27,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:09:27,912 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 57 treesize of output 25 [2023-11-29 05:09:27,990 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 14 [2023-11-29 05:09:27,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:09:28,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:28,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-29 05:09:28,328 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:09:28,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:09:29,103 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 59 treesize of output 27 [2023-11-29 05:09:29,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:09:29,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:09:29,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:09:29,317 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:09:29,317 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 69 [2023-11-29 05:09:29,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 32 [2023-11-29 05:09:29,469 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 60 treesize of output 43 [2023-11-29 05:09:29,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 05:09:29,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-29 05:09:29,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-11-29 05:09:29,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-29 05:09:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:29,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:30,036 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5730 (Array Int Int)) (v_ArrVal_5729 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5729) .cse0) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5730) .cse0) .cse1)))) (forall ((v_ArrVal_5729 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5729) .cse0) .cse1) 8))))) is different from false [2023-11-29 05:09:30,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:30,185 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 31 treesize of output 32 [2023-11-29 05:09:30,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:30,198 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 234 treesize of output 225 [2023-11-29 05:09:30,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-11-29 05:09:30,211 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 43 treesize of output 37 [2023-11-29 05:09:30,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:30,242 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 59 treesize of output 60 [2023-11-29 05:09:30,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:09:30,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:09:30,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2023-11-29 05:09:31,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:31,196 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 194 treesize of output 198 [2023-11-29 05:09:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748318720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:31,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:09:31,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 30] total 47 [2023-11-29 05:09:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992984218] [2023-11-29 05:09:31,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:09:31,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-29 05:09:31,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-29 05:09:31,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3134, Unknown=1, NotChecked=112, Total=3422 [2023-11-29 05:09:31,937 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 48 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:09:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:35,392 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-29 05:09:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:09:35,392 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2023-11-29 05:09:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:35,393 INFO L225 Difference]: With dead ends: 104 [2023-11-29 05:09:35,393 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 05:09:35,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=363, Invalid=5190, Unknown=1, NotChecked=146, Total=5700 [2023-11-29 05:09:35,396 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 268 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:35,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1223 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 05:09:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 05:09:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2023-11-29 05:09:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:09:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-11-29 05:09:35,400 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 50 [2023-11-29 05:09:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:35,400 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-11-29 05:09:35,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-29 05:09:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-11-29 05:09:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:09:35,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:35,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:35,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-29 05:09:35,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:35,601 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:09:35,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1440362999, now seen corresponding path program 1 times [2023-11-29 05:09:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703211566] [2023-11-29 05:09:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:09:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:09:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:38,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:09:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:09:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703211566] [2023-11-29 05:09:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703211566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160119048] [2023-11-29 05:09:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:38,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:38,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:09:38,724 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:09:38,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 05:09:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:39,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 165 conjunts are in the unsatisfiable core [2023-11-29 05:09:39,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:39,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:09:39,726 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:09:39,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 05:09:39,753 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:09:39,753 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-29 05:09:40,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:09:40,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:09:40,178 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:40,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2023-11-29 05:09:40,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:09:40,510 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 05:09:40,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2023-11-29 05:09:40,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:40,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:09:40,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-11-29 05:09:40,661 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 70 treesize of output 41 [2023-11-29 05:09:40,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2023-11-29 05:09:40,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:09:40,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:09:40,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:40,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2023-11-29 05:09:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:41,369 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 70 treesize of output 41 [2023-11-29 05:09:41,385 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-29 05:09:41,385 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 1 case distinctions, treesize of input 22 treesize of output 29 [2023-11-29 05:09:41,409 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:09:41,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:09:41,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2023-11-29 05:09:42,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2023-11-29 05:09:42,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 46 [2023-11-29 05:09:42,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2023-11-29 05:09:42,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2023-11-29 05:09:42,690 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 05:09:42,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 59 [2023-11-29 05:09:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:42,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2023-11-29 05:09:42,905 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 05:09:42,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 109 [2023-11-29 05:09:42,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:42,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 76 [2023-11-29 05:09:43,152 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 179 treesize of output 123 [2023-11-29 05:09:44,100 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:09:44,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 63 [2023-11-29 05:09:44,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 26 [2023-11-29 05:09:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:44,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:45,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:45,048 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 154 [2023-11-29 05:09:45,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:45,056 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 136 [2023-11-29 05:09:45,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:45,077 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2023-11-29 05:09:45,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:45,084 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 78 [2023-11-29 05:09:59,490 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_6046 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse6 (+ .cse9 4))) (or (< 0 (+ (let ((.cse0 (let ((.cse5 (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_6))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))) (select (select .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_5) .cse2 v_ArrVal_6046) .cse3) .cse4)) (select (select .cse0 .cse3) .cse4))) 9)) (not (= (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse2)) (< .cse8 .cse9) (< .cse6 0))))) (forall ((v_ArrVal_6046 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse10 (+ .cse11 4))) (or (< .cse10 0) (< .cse8 .cse11) (let ((.cse12 (let ((.cse16 (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_4))) (store .cse16 .cse2 (store (select .cse16 .cse2) .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse15 (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_3) .cse2 v_ArrVal_6046))) (let ((.cse13 (select (select .cse15 .cse3) .cse4)) (.cse14 (select (select .cse12 .cse3) .cse4))) (< (+ 11 (select (select .cse12 .cse13) .cse14)) (select |c_#length| (select (select .cse15 .cse13) .cse14))))) (not (= .cse2 (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))))) is different from false [2023-11-29 05:09:59,594 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse18 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse8 (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse2 (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_6046 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse6 (+ .cse9 4))) (or (< 0 (+ 9 (let ((.cse0 (let ((.cse5 (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_6))) (store .cse5 .cse2 (store (select .cse5 .cse2) .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))) (select (select .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_5) .cse2 v_ArrVal_6046) .cse3) .cse4)) (select (select .cse0 .cse3) .cse4))))) (not (= (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse2)) (< .cse8 .cse9) (< .cse6 0))))) (forall ((v_ArrVal_6046 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse10 (+ .cse11 4))) (or (< .cse10 0) (< .cse8 .cse11) (let ((.cse12 (let ((.cse16 (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_4))) (store .cse16 .cse2 (store (select .cse16 .cse2) .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse15 (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_3) .cse2 v_ArrVal_6046))) (let ((.cse13 (select (select .cse15 .cse3) .cse4)) (.cse14 (select (select .cse12 .cse3) .cse4))) (< (+ 11 (select (select .cse12 .cse13) .cse14)) (select |c_#length| (select (select .cse15 .cse13) .cse14))))) (not (= .cse2 (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))))) is different from false [2023-11-29 05:09:59,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#1.offset| .cse20)) (.cse17 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse18 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse20 (store .cse17 .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (store |c_#memory_$Pointer$#1.offset| .cse20 (store .cse19 .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse11 (select .cse19 .cse18)) (.cse7 (select .cse17 .cse18))) (and (forall ((v_ArrVal_6046 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse12 (select v_arrayElimArr_4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse9 (+ .cse12 4))) (or (let ((.cse0 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_4))) (store .cse8 .cse7 (store (select .cse8 .cse7) .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse3 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_3) .cse7 v_ArrVal_6046))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (select (select .cse0 .cse4) .cse5))) (< (+ (select (select .cse0 .cse1) .cse2) 11) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (< .cse9 0) (< .cse11 .cse12) (not (= .cse7 (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_6046 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (let ((.cse15 (+ .cse16 4))) (or (< 0 (+ (let ((.cse13 (let ((.cse14 (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_6))) (store .cse14 .cse7 (store (select .cse14 .cse7) .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))) (select (select .cse13 (select (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_5) .cse7 v_ArrVal_6046) .cse4) .cse5)) (select (select .cse13 .cse4) .cse5))) 9)) (< .cse11 .cse16) (not (= (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) .cse7)) (< .cse15 0))))))))) is different from false [2023-11-29 05:09:59,794 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| .cse17)) (.cse18 (select |c_#memory_$Pointer$#1.offset| .cse17)) (.cse19 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (select .cse18 .cse19)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse17 (store .cse20 .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select .cse20 .cse19)) (.cse12 (store |c_#memory_$Pointer$#1.offset| .cse17 (store .cse18 .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (and (forall ((v_ArrVal_6046 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (let ((.cse3 (+ .cse2 4))) (or (not (= .cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (< .cse1 .cse2) (< .cse3 0) (let ((.cse4 (let ((.cse11 (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_4))) (store .cse11 .cse0 (store (select .cse11 .cse0) .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (.cse7 (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_3) .cse0 v_ArrVal_6046))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (select (select .cse4 .cse8) .cse9))) (< (+ (select (select .cse4 .cse5) .cse6) 11) (select |c_#length| (select (select .cse7 .cse5) .cse6))))))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_6046 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (let ((.cse13 (+ .cse14 4))) (or (not (= .cse0 (select v_arrayElimArr_5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))) (< .cse13 0) (< .cse1 .cse14) (< 0 (+ (let ((.cse15 (let ((.cse16 (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_6))) (store .cse16 .cse0 (store (select .cse16 .cse0) .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))))) (select (select .cse15 (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_5) .cse0 v_ArrVal_6046) .cse8) .cse9)) (select (select .cse15 .cse8) .cse9))) 9)))))))))) is different from false [2023-11-29 05:10:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160119048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:01,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:10:01,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 62 [2023-11-29 05:10:01,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964611264] [2023-11-29 05:10:01,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:10:01,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-29 05:10:01,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:10:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-29 05:10:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4894, Unknown=10, NotChecked=572, Total=5700 [2023-11-29 05:10:01,439 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 63 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:10:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:10:16,386 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2023-11-29 05:10:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 05:10:16,386 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-11-29 05:10:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:10:16,387 INFO L225 Difference]: With dead ends: 122 [2023-11-29 05:10:16,387 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 05:10:16,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=527, Invalid=9379, Unknown=10, NotChecked=796, Total=10712 [2023-11-29 05:10:16,389 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 373 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 3189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:10:16,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1942 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3189 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-29 05:10:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 05:10:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2023-11-29 05:10:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 105 states have internal predecessors, (122), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:10:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2023-11-29 05:10:16,393 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 53 [2023-11-29 05:10:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:10:16,393 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2023-11-29 05:10:16,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:10:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2023-11-29 05:10:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:10:16,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:10:16,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:10:16,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 05:10:16,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:16,595 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:10:16,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:10:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1440362998, now seen corresponding path program 1 times [2023-11-29 05:10:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:10:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28762547] [2023-11-29 05:10:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:10:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:19,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:10:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:10:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:10:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:10:20,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:10:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28762547] [2023-11-29 05:10:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28762547] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687115901] [2023-11-29 05:10:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:20,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:20,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:10:20,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:10:20,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 05:10:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:20,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 05:10:20,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:10:20,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:10:21,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:10:21,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:10:21,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:10:21,979 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:10:21,980 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 32 treesize of output 31 [2023-11-29 05:10:22,406 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:10:22,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 05:10:22,617 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 57 treesize of output 25 [2023-11-29 05:10:22,820 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 14 [2023-11-29 05:10:22,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:10:23,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:23,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-29 05:10:23,697 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:10:23,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:10:25,091 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 59 treesize of output 27 [2023-11-29 05:10:25,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:10:25,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:10:25,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:10:25,474 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2023-11-29 05:10:25,474 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 50 [2023-11-29 05:10:25,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2023-11-29 05:10:25,840 INFO L349 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2023-11-29 05:10:25,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 137 [2023-11-29 05:10:25,882 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2023-11-29 05:10:25,882 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 134 treesize of output 115 [2023-11-29 05:10:26,197 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 109 treesize of output 65 [2023-11-29 05:10:26,444 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 45 [2023-11-29 05:10:26,766 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 05:10:26,766 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 61 treesize of output 24 [2023-11-29 05:10:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:26,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:10:26,849 INFO L349 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2023-11-29 05:10:26,849 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 49 treesize of output 48 [2023-11-29 05:10:26,859 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6359 (Array Int Int)) (v_ArrVal_6358 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6359) .cse1) .cse2))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) is different from false [2023-11-29 05:10:27,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:27,411 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2023-11-29 05:10:28,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:28,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-11-29 05:10:28,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:28,121 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 282 treesize of output 285 [2023-11-29 05:10:28,131 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 260 treesize of output 248 [2023-11-29 05:10:28,143 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 126 treesize of output 120 [2023-11-29 05:10:29,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse4))) (let ((.cse2 (not .cse12)) (.cse8 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (let ((.cse0 (and (or .cse2 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse18 (let ((.cse19 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse19 (select (select .cse19 .cse4) .cse1))))) (or (= (select .cse18 v_arrayElimCell_223) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse18 v_arrayElimCell_224)) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse20 (let ((.cse21 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse21 (select (select .cse21 .cse4) .cse1))))) (or (= (select .cse20 v_arrayElimCell_223) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse20 v_arrayElimCell_224)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse20 v_arrayElimCell_225) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) (or .cse12 (and (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (= (select (let ((.cse22 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse22 (select (select .cse22 .cse4) .cse1))) v_arrayElimCell_223) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse24 (select (select .cse24 .cse4) .cse1))))) (or (= (select .cse23 v_arrayElimCell_223) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (forall ((v_arrayElimCell_225 Int)) (= (select .cse23 v_arrayElimCell_225) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))))))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse1)) (or .cse2 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (or (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse3 (select (select .cse3 .cse4) .cse1))) v_arrayElimCell_224)) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse6 (let ((.cse7 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse7 (select (select .cse7 .cse4) .cse1))))) (or (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse6 v_arrayElimCell_224)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse6 v_arrayElimCell_225) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (select .cse6 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) (or (and (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (= (select (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse9 (select (select .cse9 .cse4) .cse1))) v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse10 (let ((.cse11 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse11 (select (select .cse11 .cse4) .cse1))))) (or (forall ((v_arrayElimCell_225 Int)) (= (select .cse10 v_arrayElimCell_225) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (select .cse10 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) .cse12) (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse4)) (or .cse2 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse13 (let ((.cse14 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse14 (select (select .cse14 .cse4) .cse1))))) (or (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse13 v_arrayElimCell_224)) (= (select .cse13 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))))) (or (and (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_225 Int)) (or (= (select (let ((.cse15 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse15 (select (select .cse15 .cse4) .cse1))) v_arrayElimCell_225) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) .cse12) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= (select v_arrayElimArr_7 v_arrayElimCell_222) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse16 (let ((.cse17 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6358))) (select .cse17 (select (select .cse17 .cse4) .cse1))))) (or (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select .cse16 v_arrayElimCell_224)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse16 v_arrayElimCell_225) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))))))) (not .cse8))))))) is different from false [2023-11-29 05:10:31,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse3 .cse1))) (let ((.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse12 (not .cse9))) (let ((.cse0 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse19 (let ((.cse20 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse20 (select (select .cse20 .cse1) .cse5))))) (or (= (select .cse19 v_arrayElimCell_223) .cse3) (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse19 v_arrayElimCell_225))) (= .cse3 (select .cse19 v_arrayElimCell_224))))) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))))) (or .cse9 (and (or .cse2 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select (let ((.cse21 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse21 (select (select .cse21 .cse1) .cse5))) v_arrayElimCell_223) .cse3)))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse22 (let ((.cse23 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse23 (select (select .cse23 .cse1) .cse5))))) (or (= (select .cse22 v_arrayElimCell_223) .cse3) (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse22 v_arrayElimCell_225)))))) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse24 (let ((.cse25 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse25 (select (select .cse25 .cse1) .cse5))))) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select .cse24 v_arrayElimCell_223) .cse3) (= .cse3 (select .cse24 v_arrayElimCell_224))))) .cse12)))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse1)) (or (and (or .cse2 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (= .cse3 (select (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse4 (select (select .cse4 .cse1) .cse5))) v_arrayElimCell_222)) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222)))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse8 (select (select .cse8 .cse1) .cse5))))) (or (= .cse3 (select .cse7 v_arrayElimCell_222)) (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse7 v_arrayElimCell_225))))))))) .cse9) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse10 (let ((.cse11 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse11 (select (select .cse11 .cse1) .cse5))))) (or (= .cse3 (select .cse10 v_arrayElimCell_222)) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse3 (select .cse10 v_arrayElimCell_224))))) .cse12) (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse3 (select (let ((.cse13 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse13 (select (select .cse13 .cse1) .cse5))) v_arrayElimCell_224))))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse5)) (or (not .cse2) (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse14 (let ((.cse15 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse15 (select (select .cse15 .cse1) .cse5))))) (or (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse14 v_arrayElimCell_225))) (= .cse3 (select .cse14 v_arrayElimCell_224))))) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_225 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse3 (select (let ((.cse16 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse16 (select (select .cse16 .cse1) .cse5))) v_arrayElimCell_225)))) .cse9))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse17 (let ((.cse18 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse18 (select (select .cse18 .cse1) .cse5))))) (or (= .cse3 (select .cse17 v_arrayElimCell_222)) (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse17 v_arrayElimCell_225))) (= .cse3 (select .cse17 v_arrayElimCell_224))))) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222)))))))))) is different from false [2023-11-29 05:10:31,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse0 (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= .cse0 .cse3))) (let ((.cse10 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3)) (.cse17 (not .cse6)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (let ((.cse14 (and (or (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse19 (let ((.cse20 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse20 (select (select .cse20 .cse3) .cse4))))) (or (= .cse0 (select .cse19 v_arrayElimCell_223)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse19 v_arrayElimCell_225) .cse0))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (= .cse0 (select (let ((.cse21 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse21 (select (select .cse21 .cse3) .cse4))) v_arrayElimCell_223)) (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))))) .cse10)) .cse6) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse22 (let ((.cse23 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse23 (select (select .cse23 .cse3) .cse4))))) (or (= .cse0 (select .cse22 v_arrayElimCell_223)) (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse0 (select .cse22 v_arrayElimCell_224))))) .cse17) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse24 (let ((.cse25 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse25 (select (select .cse25 .cse3) .cse4))))) (or (= .cse0 (select .cse24 v_arrayElimCell_223)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse24 v_arrayElimCell_225) .cse0)) (= .cse0 (select .cse24 v_arrayElimCell_224)))))))))) (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse1 (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse2 (select (select .cse2 .cse3) .cse4))))) (or (= (select .cse1 v_arrayElimCell_222) .cse0) (forall ((v_arrayElimCell_225 Int)) (= (select .cse1 v_arrayElimCell_225) .cse0)) (= .cse0 (select .cse1 v_arrayElimCell_224))))))) (or .cse6 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse8 (select (select .cse8 .cse3) .cse4))))) (or (= (select .cse7 v_arrayElimCell_222) .cse0) (forall ((v_arrayElimCell_225 Int)) (= (select .cse7 v_arrayElimCell_225) .cse0))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse9 (select (select .cse9 .cse3) .cse4))) v_arrayElimCell_222) .cse0))) .cse10))) (or (not .cse10) (and (or .cse6 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_225 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select (let ((.cse11 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse11 (select (select .cse11 .cse3) .cse4))) v_arrayElimCell_225) .cse0)))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse12 (let ((.cse13 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse13 (select (select .cse13 .cse3) .cse4))))) (or (forall ((v_arrayElimCell_225 Int)) (= (select .cse12 v_arrayElimCell_225) .cse0)) (= .cse0 (select .cse12 v_arrayElimCell_224))))))))) (or .cse14 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse4)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse15 (let ((.cse16 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse16 (select (select .cse16 .cse3) .cse4))))) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select .cse15 v_arrayElimCell_222) .cse0) (= .cse0 (select .cse15 v_arrayElimCell_224))))) .cse17) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (or (not (= .cse0 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse0 (select (let ((.cse18 (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_6358))) (select .cse18 (select (select .cse18 .cse3) .cse4))) v_arrayElimCell_224)))) .cse17) (or .cse14 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse3)))))))) is different from false [2023-11-29 05:10:32,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse9)) (.cse17 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (select .cse28 .cse17)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= .cse1 .cse4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse9 (store .cse28 .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse13 (not .cse7))) (let ((.cse10 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse21 (let ((.cse22 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse22 (select (select .cse22 .cse4) .cse5))))) (or (= .cse1 (select .cse21 v_arrayElimCell_224)) (= (select .cse21 v_arrayElimCell_223) .cse1) (forall ((v_arrayElimCell_225 Int)) (= (select .cse21 v_arrayElimCell_225) .cse1))))) (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))))) (or .cse7 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse24 (select (select .cse24 .cse4) .cse5))))) (or (= (select .cse23 v_arrayElimCell_223) .cse1) (forall ((v_arrayElimCell_225 Int)) (= (select .cse23 v_arrayElimCell_225) .cse1))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select (let ((.cse25 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse25 (select (select .cse25 .cse4) .cse5))) v_arrayElimCell_223) .cse1))) .cse0))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse26 (let ((.cse27 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse27 (select (select .cse27 .cse4) .cse5))))) (or (= .cse1 (select .cse26 v_arrayElimCell_224)) (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select .cse26 v_arrayElimCell_223) .cse1)))) .cse13)))) (and (or (not .cse0) (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse2 (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse3 (select (select .cse3 .cse4) .cse5))))) (or (= .cse1 (select .cse2 v_arrayElimCell_224)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse2 v_arrayElimCell_225) .cse1))))))) (or .cse7 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_225 Int)) (or (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse8 (select (select .cse8 .cse4) .cse5))) v_arrayElimCell_225) .cse1)))))) (or (= .cse9 .cse4) .cse10) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse11 (let ((.cse12 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse12 (select (select .cse12 .cse4) .cse5))))) (or (= .cse1 (select .cse11 v_arrayElimCell_224)) (forall ((v_arrayElimCell_225 Int)) (= (select .cse11 v_arrayElimCell_225) .cse1)) (= .cse1 (select .cse11 v_arrayElimCell_222))))))) (or .cse13 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (or (= .cse1 (select (let ((.cse14 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse14 (select (select .cse14 .cse4) .cse5))) v_arrayElimCell_224)) (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222)))))) (or .cse13 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse15 (let ((.cse16 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse16 (select (select .cse16 .cse4) .cse5))))) (or (= .cse1 (select .cse15 v_arrayElimCell_224)) (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse1 (select .cse15 v_arrayElimCell_222)))))) (or (= .cse17 .cse5) .cse10) (or .cse7 (and (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse1 (select (let ((.cse18 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse18 (select (select .cse18 .cse4) .cse5))) v_arrayElimCell_222)))) .cse0) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse19 (let ((.cse20 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_6358))) (select .cse20 (select (select .cse20 .cse4) .cse5))))) (or (forall ((v_arrayElimCell_225 Int)) (= (select .cse19 v_arrayElimCell_225) .cse1)) (= .cse1 (select .cse19 v_arrayElimCell_222))))) (not (= .cse1 (select v_arrayElimArr_7 v_arrayElimCell_222)))))))))))))) is different from false [2023-11-29 05:10:32,851 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse28 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse20 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse28 .cse20)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse3 .cse2))) (let ((.cse12 (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse16 (not .cse8)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse28 .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (let ((.cse0 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse21 (let ((.cse22 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse22 (select (select .cse22 .cse2) .cse6))))) (or (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse21 v_arrayElimCell_225))) (= (select .cse21 v_arrayElimCell_223) .cse3) (= .cse3 (select .cse21 v_arrayElimCell_224))))) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))))) (or .cse8 (and (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse24 (select (select .cse24 .cse2) .cse6))))) (or (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse23 v_arrayElimCell_225))) (= (select .cse23 v_arrayElimCell_223) .cse3)))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select (let ((.cse25 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse25 (select (select .cse25 .cse2) .cse6))) v_arrayElimCell_223) .cse3))) .cse12))) (or .cse16 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse26 (let ((.cse27 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse27 (select (select .cse27 .cse2) .cse6))))) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= (select .cse26 v_arrayElimCell_223) .cse3) (= .cse3 (select .cse26 v_arrayElimCell_224))))))))) (and (or .cse0 (= .cse1 .cse2)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse4 (let ((.cse5 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse5 (select (select .cse5 .cse2) .cse6))))) (or (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse4 v_arrayElimCell_225))) (= .cse3 (select .cse4 v_arrayElimCell_222)) (= .cse3 (select .cse4 v_arrayElimCell_224))))))) (or (and (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_225 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse3 (select (let ((.cse9 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse9 (select (select .cse9 .cse2) .cse6))) v_arrayElimCell_225))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (forall ((v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_224 Int)) (let ((.cse10 (let ((.cse11 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse11 (select (select .cse11 .cse2) .cse6))))) (or (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse10 v_arrayElimCell_225))) (= .cse3 (select .cse10 v_arrayElimCell_224)))))))) (not .cse12)) (or .cse8 (and (or .cse12 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (= .cse3 (select (let ((.cse13 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse13 (select (select .cse13 .cse2) .cse6))) v_arrayElimCell_222)) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222)))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_222 Int)) (or (forall ((v_ArrVal_6358 (Array Int Int))) (let ((.cse14 (let ((.cse15 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse15 (select (select .cse15 .cse2) .cse6))))) (or (forall ((v_arrayElimCell_225 Int)) (= .cse3 (select .cse14 v_arrayElimCell_225))) (= .cse3 (select .cse14 v_arrayElimCell_222))))) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))))))) (or .cse16 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (or (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse3 (select (let ((.cse17 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse17 (select (select .cse17 .cse2) .cse6))) v_arrayElimCell_224))))) (or .cse16 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_6358 (Array Int Int)) (v_arrayElimCell_222 Int) (v_arrayElimCell_224 Int)) (let ((.cse18 (let ((.cse19 (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_6358))) (select .cse19 (select (select .cse19 .cse2) .cse6))))) (or (= .cse3 (select .cse18 v_arrayElimCell_222)) (not (= .cse3 (select v_arrayElimArr_7 v_arrayElimCell_222))) (= .cse3 (select .cse18 v_arrayElimCell_224)))))) (or .cse0 (= .cse20 .cse6))))))))) is different from false [2023-11-29 05:10:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687115901] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:38,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:10:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2023-11-29 05:10:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499536693] [2023-11-29 05:10:38,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:10:38,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-29 05:10:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:10:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-29 05:10:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3444, Unknown=46, NotChecked=738, Total=4422 [2023-11-29 05:10:38,497 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand has 58 states, 49 states have (on average 1.836734693877551) internal successors, (90), 49 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:10:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:10:48,065 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2023-11-29 05:10:48,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 05:10:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 49 states have (on average 1.836734693877551) internal successors, (90), 49 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-11-29 05:10:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:10:48,067 INFO L225 Difference]: With dead ends: 136 [2023-11-29 05:10:48,067 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 05:10:48,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=389, Invalid=6391, Unknown=50, NotChecked=1002, Total=7832 [2023-11-29 05:10:48,068 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:10:48,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1335 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-11-29 05:10:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 05:10:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 111. [2023-11-29 05:10:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.4) internal successors, (119), 105 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:10:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2023-11-29 05:10:48,071 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 53 [2023-11-29 05:10:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:10:48,072 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2023-11-29 05:10:48,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 49 states have (on average 1.836734693877551) internal successors, (90), 49 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:10:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2023-11-29 05:10:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 05:10:48,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:10:48,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:10:48,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 05:10:48,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:48,273 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 79 more)] === [2023-11-29 05:10:48,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:10:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1701474025, now seen corresponding path program 1 times [2023-11-29 05:10:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:10:48,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364188622] [2023-11-29 05:10:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:10:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:10:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:10:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:10:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:10:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:10:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364188622] [2023-11-29 05:10:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364188622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770520313] [2023-11-29 05:10:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:52,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:52,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:10:52,680 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:10:52,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c1c4fec-a532-4993-8987-f70045406a37/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 05:10:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:53,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 143 conjunts are in the unsatisfiable core [2023-11-29 05:10:53,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:10:53,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-29 05:10:53,950 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:10:53,950 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-29 05:10:54,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:10:54,564 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:10:54,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 05:10:55,012 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 05:10:55,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 05:10:55,227 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 57 treesize of output 36 [2023-11-29 05:10:55,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2023-11-29 05:10:55,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:10:56,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:10:56,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:56,310 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 57 treesize of output 34 [2023-11-29 05:10:56,375 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 05:10:56,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:10:57,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:10:58,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 41 [2023-11-29 05:10:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:10:58,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:10:58,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-29 05:10:58,321 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 59 treesize of output 36 [2023-11-29 05:10:58,392 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:10:58,392 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 166 treesize of output 99 [2023-11-29 05:10:58,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-11-29 05:10:58,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-11-29 05:10:58,725 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:10:58,725 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 140 treesize of output 85 [2023-11-29 05:10:58,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 19 [2023-11-29 05:10:58,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-11-29 05:10:59,073 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 86 treesize of output 50 [2023-11-29 05:10:59,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-29 05:10:59,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:10:59,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:10:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:59,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:11:07,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:07,277 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 83 treesize of output 84 [2023-11-29 05:11:07,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:07,311 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 650 treesize of output 641 [2023-11-29 05:11:07,324 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 147 treesize of output 141 [2023-11-29 05:11:07,336 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 152 treesize of output 140 [2023-11-29 05:21:09,929 WARN L293 SmtUtils]: Spent 9.25m on a formula simplification. DAG size of input: 2320 DAG size of output: 1814 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 05:21:09,930 INFO L349 Elim1Store]: treesize reduction 17017, result has 71.4 percent of original size [2023-11-29 05:21:09,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 31 new quantified variables, introduced 466 case distinctions, treesize of input 137631 treesize of output 171032 [2023-11-29 05:21:15,671 INFO L224 Elim1Store]: Index analysis took 1594 ms