./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:03:27,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:03:27,974 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 22:03:27,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:03:27,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:03:28,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:03:28,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:03:28,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:03:28,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:03:28,047 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:03:28,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:03:28,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:03:28,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:03:28,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:03:28,052 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:03:28,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:03:28,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 22:03:28,054 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:03:28,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:03:28,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:03:28,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:03:28,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 22:03:28,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:03:28,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 22:03:28,058 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:03:28,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 22:03:28,060 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:03:28,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:03:28,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:03:28,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:03:28,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:03:28,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:28,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:03:28,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:03:28,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 22:03:28,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:03:28,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:03:28,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:03:28,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:03:28,067 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 22:03:28,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:03:28,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:03:28,068 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_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-24 22:03:28,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:03:28,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:03:28,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:03:28,544 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:03:28,544 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:03:28,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-24 22:03:31,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:03:32,235 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:03:32,236 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-24 22:03:32,258 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/data/792b20f3e/acea6a32dcac4fe2adbb750e264f63d7/FLAGee427efaa [2023-11-24 22:03:32,283 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/data/792b20f3e/acea6a32dcac4fe2adbb750e264f63d7 [2023-11-24 22:03:32,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:03:32,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:03:32,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:32,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:03:32,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:03:32,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b7fc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:32, skipping insertion in model container [2023-11-24 22:03:32,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:03:32" (1/1) ... [2023-11-24 22:03:32,390 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:03:32,808 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-24 22:03:32,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:32,840 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:03:32,950 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-24 22:03:32,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:03:33,002 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:03:33,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33 WrapperNode [2023-11-24 22:03:33,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:03:33,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:33,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:03:33,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:03:33,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,104 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-11-24 22:03:33,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:03:33,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:03:33,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:03:33,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:03:33,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,156 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-11-24 22:03:33,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:03:33,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:03:33,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:03:33,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:03:33,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (1/1) ... [2023-11-24 22:03:33,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:03:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:33,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:03:33,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:03:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 22:03:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 22:03:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 22:03:33,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:03:33,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:03:33,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:03:33,279 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-24 22:03:33,280 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-24 22:03:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 22:03:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:03:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:03:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 22:03:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 22:03:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-24 22:03:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 22:03:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 22:03:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-24 22:03:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:03:33,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-24 22:03:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-24 22:03:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-24 22:03:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:03:33,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:03:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:03:33,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:03:33,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:03:33,454 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:03:33,457 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:03:33,766 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:03:33,822 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:03:33,823 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-24 22:03:33,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:33 BoogieIcfgContainer [2023-11-24 22:03:33,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:03:33,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:03:33,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:03:33,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:03:33,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:03:32" (1/3) ... [2023-11-24 22:03:33,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a0eb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:33, skipping insertion in model container [2023-11-24 22:03:33,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:03:33" (2/3) ... [2023-11-24 22:03:33,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a0eb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:03:33, skipping insertion in model container [2023-11-24 22:03:33,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:03:33" (3/3) ... [2023-11-24 22:03:33,840 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-24 22:03:33,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:03:33,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 22:03:33,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:03:33,928 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@49b0d1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:03:33,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 22:03:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 22:03:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 22:03:33,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:33,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:33,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:33,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2023-11-24 22:03:33,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:33,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794424169] [2023-11-24 22:03:33,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-24 22:03:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 22:03:34,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794424169] [2023-11-24 22:03:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794424169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:03:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696795922] [2023-11-24 22:03:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:03:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:03:34,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:34,578 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 22:03:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:34,693 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2023-11-24 22:03:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:03:34,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-24 22:03:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:34,705 INFO L225 Difference]: With dead ends: 54 [2023-11-24 22:03:34,706 INFO L226 Difference]: Without dead ends: 23 [2023-11-24 22:03:34,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:03:34,718 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:34,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-24 22:03:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-24 22:03:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 22:03:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-11-24 22:03:34,769 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2023-11-24 22:03:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:34,771 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-11-24 22:03:34,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 22:03:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-11-24 22:03:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 22:03:34,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:34,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:34,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:03:34,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:34,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2023-11-24 22:03:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777788376] [2023-11-24 22:03:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-24 22:03:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 22:03:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777788376] [2023-11-24 22:03:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777788376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:35,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640174364] [2023-11-24 22:03:35,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:35,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:35,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:35,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:35,075 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 22:03:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:35,149 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-11-24 22:03:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-24 22:03:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:35,151 INFO L225 Difference]: With dead ends: 43 [2023-11-24 22:03:35,151 INFO L226 Difference]: Without dead ends: 26 [2023-11-24 22:03:35,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:35,154 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:35,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-24 22:03:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-24 22:03:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 22:03:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-24 22:03:35,164 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2023-11-24 22:03:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:35,165 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-24 22:03:35,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-24 22:03:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-24 22:03:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 22:03:35,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:35,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:03:35,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:35,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2023-11-24 22:03:35,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:35,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247675073] [2023-11-24 22:03:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 22:03:35,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247675073] [2023-11-24 22:03:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247675073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 22:03:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772252746] [2023-11-24 22:03:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:35,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:03:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:03:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:03:35,463 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-24 22:03:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:35,551 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-11-24 22:03:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:03:35,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 25 [2023-11-24 22:03:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:35,555 INFO L225 Difference]: With dead ends: 34 [2023-11-24 22:03:35,555 INFO L226 Difference]: Without dead ends: 27 [2023-11-24 22:03:35,556 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-24 22:03:35,560 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:35,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-24 22:03:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-24 22:03:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 22:03:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-24 22:03:35,577 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 25 [2023-11-24 22:03:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:35,577 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-24 22:03:35,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-24 22:03:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-24 22:03:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 22:03:35,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:35,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:35,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:03:35,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:35,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2023-11-24 22:03:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419267779] [2023-11-24 22:03:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:37,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 22:03:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419267779] [2023-11-24 22:03:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419267779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:03:38,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354206172] [2023-11-24 22:03:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:38,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:03:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:38,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:03:38,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 22:03:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:39,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-24 22:03:39,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:39,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:03:39,598 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-24 22:03:39,710 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 22:03:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-24 22:03:39,824 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-24 22:03:39,973 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-24 22:03:40,135 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 11 treesize of output 3 [2023-11-24 22:03:40,142 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-24 22:03:40,428 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-24 22:03:40,429 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 20 treesize of output 22 [2023-11-24 22:03:40,447 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-24 22:03:40,838 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-11-24 22:03:40,848 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-24 22:03:40,943 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-24 22:03:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:03:41,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:03:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354206172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:03:41,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 22:03:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-11-24 22:03:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372485773] [2023-11-24 22:03:41,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 22:03:41,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-24 22:03:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-24 22:03:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1974, Unknown=33, NotChecked=0, Total=2162 [2023-11-24 22:03:41,766 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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-24 22:03:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:43,338 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-11-24 22:03:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-24 22:03:43,339 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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 26 [2023-11-24 22:03:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:43,341 INFO L225 Difference]: With dead ends: 48 [2023-11-24 22:03:43,341 INFO L226 Difference]: Without dead ends: 46 [2023-11-24 22:03:43,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=288, Invalid=3339, Unknown=33, NotChecked=0, Total=3660 [2023-11-24 22:03:43,345 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:43,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 275 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-24 22:03:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-24 22:03:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-11-24 22:03:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-24 22:03:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-24 22:03:43,359 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 26 [2023-11-24 22:03:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:43,359 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-24 22:03:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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-24 22:03:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2023-11-24 22:03:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 22:03:43,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:43,361 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:03:43,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-24 22:03:43,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:03:43,569 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:43,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2023-11-24 22:03:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964764597] [2023-11-24 22:03:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:43,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 22:03:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:43,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964764597] [2023-11-24 22:03:43,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964764597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:43,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:43,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:03:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894559658] [2023-11-24 22:03:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:43,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:03:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:03:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:03:43,834 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-24 22:03:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:43,912 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-11-24 22:03:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:03:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 27 [2023-11-24 22:03:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:43,914 INFO L225 Difference]: With dead ends: 43 [2023-11-24 22:03:43,914 INFO L226 Difference]: Without dead ends: 32 [2023-11-24 22:03:43,914 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-24 22:03:43,915 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:43,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-24 22:03:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-24 22:03:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-24 22:03:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-11-24 22:03:43,926 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2023-11-24 22:03:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:43,927 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-11-24 22:03:43,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-24 22:03:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-11-24 22:03:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-24 22:03:43,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:43,929 INFO L195 NwaCegarLoop]: trace histogram [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-24 22:03:43,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:03:43,930 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:43,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1881720096, now seen corresponding path program 1 times [2023-11-24 22:03:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892332701] [2023-11-24 22:03:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 22:03:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892332701] [2023-11-24 22:03:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892332701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:03:44,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:03:44,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 22:03:44,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902196914] [2023-11-24 22:03:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:03:44,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 22:03:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 22:03:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 22:03:44,115 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-24 22:03:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:44,174 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-11-24 22:03:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 22:03:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 27 [2023-11-24 22:03:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:44,176 INFO L225 Difference]: With dead ends: 41 [2023-11-24 22:03:44,176 INFO L226 Difference]: Without dead ends: 31 [2023-11-24 22:03:44,177 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-24 22:03:44,177 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:44,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 22:03:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-24 22:03:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-24 22:03:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-24 22:03:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-24 22:03:44,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2023-11-24 22:03:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:44,194 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-24 22:03:44,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-24 22:03:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-24 22:03:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 22:03:44,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:44,197 INFO L195 NwaCegarLoop]: trace histogram [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-24 22:03:44,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:03:44,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:44,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2023-11-24 22:03:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:44,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897196696] [2023-11-24 22:03:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 22:03:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897196696] [2023-11-24 22:03:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897196696] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:03:45,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935553137] [2023-11-24 22:03:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:45,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:03:45,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:45,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:03:45,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 22:03:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:45,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-24 22:03:45,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:45,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:03:45,413 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 22:03:45,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-24 22:03:45,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 22:03:45,536 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-24 22:03:45,537 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 70 treesize of output 57 [2023-11-24 22:03:45,587 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 38 treesize of output 14 [2023-11-24 22:03:45,596 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-24 22:03:45,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:03:45,716 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 46 treesize of output 35 [2023-11-24 22:03:45,734 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-24 22:03:45,735 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 32 treesize of output 34 [2023-11-24 22:03:45,873 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2023-11-24 22:03:45,873 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 53 treesize of output 59 [2023-11-24 22:03:45,900 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-11-24 22:03:45,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2023-11-24 22:03:45,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-24 22:03:45,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-11-24 22:03:46,011 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 35 treesize of output 19 [2023-11-24 22:03:46,014 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-24 22:03:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:03:46,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:03:46,291 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| Int) (v_ArrVal_783 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|) 0)) (not (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|))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_783) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_780) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0))))) is different from false [2023-11-24 22:03:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935553137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:03:46,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 22:03:46,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 30 [2023-11-24 22:03:46,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290597415] [2023-11-24 22:03:46,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 22:03:46,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-24 22:03:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-24 22:03:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=893, Unknown=19, NotChecked=60, Total=1056 [2023-11-24 22:03:46,297 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 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-24 22:03:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:47,224 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2023-11-24 22:03:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 22:03:47,225 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 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 28 [2023-11-24 22:03:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:47,226 INFO L225 Difference]: With dead ends: 55 [2023-11-24 22:03:47,227 INFO L226 Difference]: Without dead ends: 52 [2023-11-24 22:03:47,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1879, Unknown=21, NotChecked=88, Total=2162 [2023-11-24 22:03:47,229 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:47,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 278 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 22:03:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-24 22:03:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2023-11-24 22:03:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-24 22:03:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-24 22:03:47,241 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2023-11-24 22:03:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:47,242 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-24 22:03:47,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 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-24 22:03:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-24 22:03:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 22:03:47,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:47,247 INFO L195 NwaCegarLoop]: trace histogram [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-24 22:03:47,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 22:03:47,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-24 22:03:47,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:47,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2023-11-24 22:03:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125199439] [2023-11-24 22:03:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 22:03:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125199439] [2023-11-24 22:03:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125199439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:03:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392919772] [2023-11-24 22:03:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:47,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:03:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:47,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:03:47,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 22:03:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:47,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 22:03:47,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 22:03:47,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:03:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-24 22:03:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392919772] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 22:03:47,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 22:03:47,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-24 22:03:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957242641] [2023-11-24 22:03:47,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 22:03:47,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 22:03:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 22:03:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 22:03:47,982 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-24 22:03:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:03:48,102 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-24 22:03:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:03:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-11-24 22:03:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:03:48,105 INFO L225 Difference]: With dead ends: 40 [2023-11-24 22:03:48,105 INFO L226 Difference]: Without dead ends: 32 [2023-11-24 22:03:48,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-24 22:03:48,107 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 22:03:48,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 22:03:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-24 22:03:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-24 22:03:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-24 22:03:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-24 22:03:48,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2023-11-24 22:03:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:03:48,124 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-24 22:03:48,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-24 22:03:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-24 22:03:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 22:03:48,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:03:48,128 INFO L195 NwaCegarLoop]: trace histogram [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-24 22:03:48,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 22:03:48,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-24 22:03:48,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:03:48,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:03:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 208832784, now seen corresponding path program 1 times [2023-11-24 22:03:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:03:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772617279] [2023-11-24 22:03:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:03:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:03:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:03:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:03:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 22:03:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:03:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772617279] [2023-11-24 22:03:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772617279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:03:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007691861] [2023-11-24 22:03:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:03:48,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:03:48,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:03:48,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:03:48,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 22:03:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:03:48,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-24 22:03:48,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:03:49,051 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-24 22:03:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:03:49,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:03:49,124 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-24 22:03:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 22:03:49,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007691861] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 22:03:49,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 22:03:49,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-24 22:03:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311829700] [2023-11-24 22:03:49,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 22:03:49,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 22:03:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:03:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 22:03:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-24 22:03:49,163 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 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-24 22:03:53,175 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-24 22:03:57,213 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-24 22:04:01,234 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-24 22:04:05,283 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-24 22:04:09,587 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-24 22:04:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 22:04:09,589 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-24 22:04:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 22:04:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 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 28 [2023-11-24 22:04:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 22:04:09,591 INFO L225 Difference]: With dead ends: 40 [2023-11-24 22:04:09,591 INFO L226 Difference]: Without dead ends: 31 [2023-11-24 22:04:09,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2023-11-24 22:04:09,592 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2023-11-24 22:04:09,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 225 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2023-11-24 22:04:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-24 22:04:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-24 22:04:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-24 22:04:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-24 22:04:09,600 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 28 [2023-11-24 22:04:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 22:04:09,601 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-24 22:04:09,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 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-24 22:04:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-24 22:04:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 22:04:09,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 22:04:09,602 INFO L195 NwaCegarLoop]: trace histogram [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-24 22:04:09,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 22:04:09,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-24 22:04:09,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 22:04:09,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:04:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2023-11-24 22:04:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:04:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243299552] [2023-11-24 22:04:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:04:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:10,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-24 22:04:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-24 22:04:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-24 22:04:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 22:04:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:04:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243299552] [2023-11-24 22:04:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243299552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:04:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370893298] [2023-11-24 22:04:11,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:04:11,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:04:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:04:11,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:04:11,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91120239-a6de-43e3-906c-f985a3fe5817/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 22:04:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:04:11,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-24 22:04:11,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:04:11,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 22:04:11,871 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-24 22:04:12,018 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-24 22:04:12,115 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 22:04:12,116 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-24 22:04:12,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 22:04:12,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-24 22:04:12,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-24 22:04:12,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-24 22:04:12,508 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-24 22:04:12,509 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 93 treesize of output 62 [2023-11-24 22:04:12,517 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 34 treesize of output 19 [2023-11-24 22:04:12,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-11-24 22:04:12,619 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 50 treesize of output 30 [2023-11-24 22:04:12,749 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 27 treesize of output 15 [2023-11-24 22:04:12,754 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-24 22:04:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:04:12,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:04:12,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:04:12,999 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 69 treesize of output 70 [2023-11-24 22:04:13,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:04:13,013 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 136 treesize of output 139 [2023-11-24 22:04:13,022 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 60 treesize of output 54 [2023-11-24 22:04:13,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:04:13,031 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 110 treesize of output 102 [2023-11-24 22:04:13,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 22:04:13,049 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 190 treesize of output 181 [2023-11-24 22:04:13,059 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 37 treesize of output 31 [2023-11-24 22:04:13,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse17)) (.cse1 (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_45 Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_45) .cse7))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_45) (+ 4 v_arrayElimCell_48)))))) (or .cse5 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) (+ 4 v_arrayElimCell_48))))) (or .cse5 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) .cse7)))))) (.cse2 (and (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283) (+ 4 v_arrayElimCell_48)))) .cse5) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (let ((.cse9 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse9) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))))))))) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49)))) (not .cse5)) (or .cse3 .cse1) (or .cse2 .cse0) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))))))) (or .cse5 (forall ((v_ArrVal_1280 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse7)))))))) is different from false [2023-11-24 22:04:14,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse7 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse18)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (= .cse5 .cse18)) (.cse8 (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_45) (+ 4 v_arrayElimCell_48)))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_45 Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_45) .cse3))))) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse16 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) .cse3)))) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse17 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) (+ 4 v_arrayElimCell_48))))))) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int)) (let ((.cse10 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse11) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_48))))))) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse5 v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283) (+ 4 v_arrayElimCell_48)))))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (let ((.cse4 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))))))) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse6 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49)))) (not .cse7)) (or .cse0 .cse8) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse5 v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse3)))) (or .cse9 .cse8) (or .cse9 .cse1))))) is different from false