./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ --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 b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:27:27,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:27:28,105 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:27:28,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:27:28,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:27:28,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:27:28,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:27:28,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:27:28,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:27:28,139 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:27:28,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:27:28,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:27:28,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:27:28,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:27:28,142 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:27:28,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:27:28,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:27:28,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:27:28,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:27:28,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:27:28,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:27:28,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:27:28,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:27:28,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:27:28,148 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:27:28,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:27:28,149 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:27:28,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:27:28,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:27:28,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:27:28,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:27:28,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:27:28,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:27:28,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:27:28,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:27:28,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:27:28,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:27:28,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:27:28,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:27:28,163 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:27:28,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:27:28,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:27:28,165 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_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/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_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2023-11-23 22:27:28,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:27:28,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:27:28,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:27:28,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:27:28,540 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:27:28,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/list-properties/list_search-2.i [2023-11-23 22:27:31,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:27:32,214 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:27:32,215 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/sv-benchmarks/c/list-properties/list_search-2.i [2023-11-23 22:27:32,238 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/data/4ad685719/20aa249142a84457a42577b8f43e6714/FLAGd03f10561 [2023-11-23 22:27:32,254 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/data/4ad685719/20aa249142a84457a42577b8f43e6714 [2023-11-23 22:27:32,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:27:32,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:27:32,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:27:32,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:27:32,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:27:32,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:32,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1318137c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32, skipping insertion in model container [2023-11-23 22:27:32,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:32,319 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:27:32,497 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_124499fe-06de-4cdf-869e-f0e2ad9060bd/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2023-11-23 22:27:32,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:27:32,844 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:27:32,860 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_124499fe-06de-4cdf-869e-f0e2ad9060bd/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2023-11-23 22:27:32,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:27:32,965 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:27:32,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32 WrapperNode [2023-11-23 22:27:32,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:27:32,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:27:32,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:27:32,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:27:32,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:32,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,021 INFO L138 Inliner]: procedures = 226, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2023-11-23 22:27:33,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:27:33,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:27:33,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:27:33,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:27:33,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,039 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,058 INFO L189 HeapSplitter]: Split 16 memory accesses to 2 slices as follows [2, 14] [2023-11-23 22:27:33,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:27:33,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:27:33,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:27:33,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:27:33,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (1/1) ... [2023-11-23 22:27:33,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:27:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:33,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:27:33,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:27:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 22:27:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 22:27:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:27:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:27:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:27:33,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:27:33,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:27:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 22:27:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:27:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 22:27:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 22:27:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-11-23 22:27:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-11-23 22:27:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:27:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:27:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:27:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:27:33,361 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:27:33,364 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:27:33,672 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:27:33,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:27:33,745 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-23 22:27:33,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:27:33 BoogieIcfgContainer [2023-11-23 22:27:33,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:27:33,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:27:33,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:27:33,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:27:33,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:27:32" (1/3) ... [2023-11-23 22:27:33,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d02bdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:27:33, skipping insertion in model container [2023-11-23 22:27:33,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:32" (2/3) ... [2023-11-23 22:27:33,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d02bdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:27:33, skipping insertion in model container [2023-11-23 22:27:33,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:27:33" (3/3) ... [2023-11-23 22:27:33,762 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2023-11-23 22:27:33,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:27:33,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:27:33,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:27:33,845 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;@b0cb0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:27:33,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:27:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:27:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 22:27:33,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:33,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:33,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:33,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -591880684, now seen corresponding path program 1 times [2023-11-23 22:27:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551221415] [2023-11-23 22:27:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 22:27:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551221415] [2023-11-23 22:27:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551221415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25931446] [2023-11-23 22:27:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:34,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:34,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:27:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 22:27:35,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 22:27:35,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:27:35,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25931446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:35,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:27:35,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2023-11-23 22:27:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871706376] [2023-11-23 22:27:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:35,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:27:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:27:35,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:27:35,209 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:35,244 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2023-11-23 22:27:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:27:35,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-23 22:27:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:35,255 INFO L225 Difference]: With dead ends: 46 [2023-11-23 22:27:35,256 INFO L226 Difference]: Without dead ends: 22 [2023-11-23 22:27:35,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:27:35,266 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:35,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:27:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-23 22:27:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-23 22:27:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:27:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-11-23 22:27:35,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 31 [2023-11-23 22:27:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:35,314 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-11-23 22:27:35,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-11-23 22:27:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 22:27:35,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:35,316 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:35,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:27:35,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:35,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:35,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:35,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1989752827, now seen corresponding path program 1 times [2023-11-23 22:27:35,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:35,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734954009] [2023-11-23 22:27:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:35,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 22:27:35,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734954009] [2023-11-23 22:27:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734954009] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80456385] [2023-11-23 22:27:35,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:35,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:35,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:35,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:27:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 22:27:36,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 22:27:36,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:27:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80456385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:36,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:27:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-11-23 22:27:36,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201080138] [2023-11-23 22:27:36,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:36,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:27:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:27:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:27:36,240 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:36,338 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2023-11-23 22:27:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:27:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-11-23 22:27:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:36,340 INFO L225 Difference]: With dead ends: 44 [2023-11-23 22:27:36,341 INFO L226 Difference]: Without dead ends: 26 [2023-11-23 22:27:36,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:27:36,345 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:36,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:27:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-23 22:27:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-11-23 22:27:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:27:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-11-23 22:27:36,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 33 [2023-11-23 22:27:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:36,369 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-11-23 22:27:36,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-11-23 22:27:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 22:27:36,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:36,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:36,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:27:36,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:36,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:36,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2005311893, now seen corresponding path program 1 times [2023-11-23 22:27:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063683099] [2023-11-23 22:27:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 22:27:37,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063683099] [2023-11-23 22:27:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063683099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:27:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:27:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292463424] [2023-11-23 22:27:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:37,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:27:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:27:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:27:37,070 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:37,145 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-11-23 22:27:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:27:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-11-23 22:27:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:37,147 INFO L225 Difference]: With dead ends: 30 [2023-11-23 22:27:37,147 INFO L226 Difference]: Without dead ends: 26 [2023-11-23 22:27:37,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:27:37,149 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:37,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:27:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-23 22:27:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-23 22:27:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:27:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-23 22:27:37,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 34 [2023-11-23 22:27:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:37,157 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-23 22:27:37,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-23 22:27:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 22:27:37,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:37,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:37,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:27:37,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:37,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2003464851, now seen corresponding path program 1 times [2023-11-23 22:27:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658832710] [2023-11-23 22:27:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 22:27:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658832710] [2023-11-23 22:27:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658832710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919131993] [2023-11-23 22:27:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:37,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:37,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:37,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:27:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 22:27:37,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 22:27:37,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 22:27:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919131993] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:27:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 17 [2023-11-23 22:27:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482172277] [2023-11-23 22:27:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:38,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:27:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:27:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-23 22:27:38,098 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:38,313 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-11-23 22:27:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 22:27:38,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-11-23 22:27:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:38,315 INFO L225 Difference]: With dead ends: 38 [2023-11-23 22:27:38,316 INFO L226 Difference]: Without dead ends: 30 [2023-11-23 22:27:38,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-11-23 22:27:38,317 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:38,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 73 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:27:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-23 22:27:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-23 22:27:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 22:27:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-23 22:27:38,326 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 34 [2023-11-23 22:27:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:38,327 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-23 22:27:38,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-23 22:27:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-23 22:27:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-23 22:27:38,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:38,329 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:38,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 22:27:38,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:38,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:38,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:38,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2075934852, now seen corresponding path program 1 times [2023-11-23 22:27:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86619630] [2023-11-23 22:27:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 22:27:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86619630] [2023-11-23 22:27:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86619630] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750726656] [2023-11-23 22:27:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:39,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:39,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:39,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:27:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:39,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-23 22:27:39,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:39,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 22:27:39,933 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 20 treesize of output 8 [2023-11-23 22:27:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:27:39,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:27:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750726656] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:27:40,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:27:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2023-11-23 22:27:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701621171] [2023-11-23 22:27:40,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:27:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 22:27:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 22:27:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2023-11-23 22:27:40,177 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 23 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:27:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:41,099 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-11-23 22:27:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 22:27:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2023-11-23 22:27:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:41,102 INFO L225 Difference]: With dead ends: 51 [2023-11-23 22:27:41,102 INFO L226 Difference]: Without dead ends: 40 [2023-11-23 22:27:41,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2023-11-23 22:27:41,104 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 135 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:41,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 160 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:27:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-23 22:27:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2023-11-23 22:27:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-23 22:27:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-11-23 22:27:41,116 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 37 [2023-11-23 22:27:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-11-23 22:27:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:27:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-11-23 22:27:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-23 22:27:41,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:41,119 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:41,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:27:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:41,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:41,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash -61018985, now seen corresponding path program 2 times [2023-11-23 22:27:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:41,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101593522] [2023-11-23 22:27:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:42,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 22:27:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101593522] [2023-11-23 22:27:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101593522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836433248] [2023-11-23 22:27:43,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 22:27:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:43,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:43,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 22:27:43,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 22:27:43,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:27:43,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-23 22:27:43,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:43,616 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-23 22:27:43,636 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 15 treesize of output 1 [2023-11-23 22:27:43,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:27:43,751 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-23 22:27:43,839 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-23 22:27:43,839 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-23 22:27:43,851 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 21 treesize of output 16 [2023-11-23 22:27:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:27:44,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:44,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:27:44,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-11-23 22:27:44,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836433248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:44,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:27:44,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 26 [2023-11-23 22:27:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115212172] [2023-11-23 22:27:44,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:27:44,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 22:27:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:44,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 22:27:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2023-11-23 22:27:44,404 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 26 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 22:27:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:45,952 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-11-23 22:27:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 22:27:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2023-11-23 22:27:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:45,954 INFO L225 Difference]: With dead ends: 63 [2023-11-23 22:27:45,954 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 22:27:45,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=356, Invalid=2296, Unknown=0, NotChecked=0, Total=2652 [2023-11-23 22:27:45,957 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 111 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:45,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 184 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:27:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 22:27:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2023-11-23 22:27:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-23 22:27:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-11-23 22:27:45,983 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 41 [2023-11-23 22:27:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:45,984 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-11-23 22:27:45,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 22:27:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-11-23 22:27:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-23 22:27:45,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:45,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:46,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 22:27:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:46,210 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:46,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash -602992484, now seen corresponding path program 3 times [2023-11-23 22:27:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:46,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042301145] [2023-11-23 22:27:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:48,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:27:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042301145] [2023-11-23 22:27:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042301145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59008623] [2023-11-23 22:27:49,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 22:27:49,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:49,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:49,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:49,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 22:27:49,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 22:27:49,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:27:49,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 100 conjunts are in the unsatisfiable core [2023-11-23 22:27:49,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:49,486 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-23 22:27:49,505 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 15 treesize of output 1 [2023-11-23 22:27:49,659 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-23 22:27:49,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:27:49,823 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-23 22:27:49,824 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 21 treesize of output 29 [2023-11-23 22:27:49,839 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 21 treesize of output 16 [2023-11-23 22:27:50,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:27:50,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:27:50,180 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-23 22:27:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-23 22:27:50,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:27:50,214 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-23 22:27:50,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2023-11-23 22:27:50,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:27:50,231 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-23 22:27:50,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-23 22:27:50,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:27:50,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-23 22:27:50,909 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-11-23 22:27:50,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2023-11-23 22:27:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 22:27:50,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:51,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:27:51,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-11-23 22:27:51,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:27:51,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2023-11-23 22:27:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59008623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:51,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:27:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 38 [2023-11-23 22:27:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675217970] [2023-11-23 22:27:51,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:27:51,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-23 22:27:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:51,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-23 22:27:51,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2023-11-23 22:27:51,388 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 38 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 5 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 22:27:55,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 22:27:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:57,096 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2023-11-23 22:27:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 22:27:57,097 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 5 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2023-11-23 22:27:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:27:57,099 INFO L225 Difference]: With dead ends: 65 [2023-11-23 22:27:57,099 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 22:27:57,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=534, Invalid=4022, Unknown=0, NotChecked=0, Total=4556 [2023-11-23 22:27:57,103 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 148 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-23 22:27:57,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 252 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 785 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2023-11-23 22:27:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 22:27:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2023-11-23 22:27:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-23 22:27:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-23 22:27:57,122 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 45 [2023-11-23 22:27:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:27:57,122 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-23 22:27:57,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 5 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 22:27:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-11-23 22:27:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-23 22:27:57,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:27:57,124 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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-23 22:27:57,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 22:27:57,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:57,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:27:57,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1915962899, now seen corresponding path program 4 times [2023-11-23 22:27:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157194590] [2023-11-23 22:27:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:27:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:27:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:28:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:28:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:28:01,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157194590] [2023-11-23 22:28:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157194590] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:28:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919441359] [2023-11-23 22:28:01,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 22:28:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:01,162 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:28:01,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 22:28:01,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 22:28:01,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:28:01,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 146 conjunts are in the unsatisfiable core [2023-11-23 22:28:01,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:28:01,431 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-23 22:28:01,443 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 18 treesize of output 7 [2023-11-23 22:28:01,549 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-23 22:28:01,558 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-23 22:28:01,676 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-23 22:28:01,676 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 21 treesize of output 29 [2023-11-23 22:28:01,693 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-23 22:28:01,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:28:01,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:28:02,087 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-23 22:28:02,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-23 22:28:02,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2023-11-23 22:28:02,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,129 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-11-23 22:28:02,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-11-23 22:28:02,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-23 22:28:02,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:28:02,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-23 22:28:02,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,476 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-23 22:28:02,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 70 [2023-11-23 22:28:02,494 INFO L349 Elim1Store]: treesize reduction 37, result has 47.1 percent of original size [2023-11-23 22:28:02,500 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 1 case distinctions, treesize of input 28 treesize of output 39 [2023-11-23 22:28:02,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,527 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-11-23 22:28:02,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-11-23 22:28:02,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:28:02,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-23 22:28:03,353 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-23 22:28:03,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 55 [2023-11-23 22:28:03,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-23 22:28:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:28:03,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:28:03,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:28:03,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2023-11-23 22:28:03,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:28:03,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2023-11-23 22:28:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919441359] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:28:04,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:28:04,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 39 [2023-11-23 22:28:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072187409] [2023-11-23 22:28:04,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:28:04,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-23 22:28:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 22:28:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1943, Unknown=0, NotChecked=0, Total=2070 [2023-11-23 22:28:04,121 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 39 states, 32 states have (on average 2.03125) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-23 22:28:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:28:06,419 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2023-11-23 22:28:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 22:28:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 2.03125) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 48 [2023-11-23 22:28:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:28:06,420 INFO L225 Difference]: With dead ends: 46 [2023-11-23 22:28:06,421 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 22:28:06,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=258, Invalid=3524, Unknown=0, NotChecked=0, Total=3782 [2023-11-23 22:28:06,424 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:28:06,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 131 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 22:28:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 22:28:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 22:28:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:28:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 22:28:06,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2023-11-23 22:28:06,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:28:06,426 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 22:28:06,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 2.03125) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-23 22:28:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 22:28:06,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 22:28:06,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 22:28:06,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 22:28:06,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:06,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 22:28:19,040 WARN L293 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 158 DAG size of output: 146 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-23 22:28:19,341 INFO L899 garLoopResultBuilder]: For program point insert_listEXIT(lines 791 802) no Hoare annotation was computed. [2023-11-23 22:28:19,341 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 791 802) the Hoare annotation is: (or (not (= |old(~head~0.offset)| 0)) (and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset 0) (= |#memory_$Pointer$#0.base| |old(#memory_$Pointer$#0.base)|) (= |#memory_int#0| |old(#memory_int#0)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |old(#memory_$Pointer$#0.offset)| |#memory_$Pointer$#0.offset|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|))) [2023-11-23 22:28:19,342 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2023-11-23 22:28:19,342 INFO L899 garLoopResultBuilder]: For program point L793-2(lines 793 799) no Hoare annotation was computed. [2023-11-23 22:28:19,342 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2023-11-23 22:28:19,342 INFO L895 garLoopResultBuilder]: At program point L812-2(lines 812 814) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0) (not (= .cse0 0)) (= (select |#valid| .cse1) 1) (= ~head~0.offset 0) (= (select (select |#memory_int#1| .cse2) 0) 2) (not (= .cse0 .cse2)) (not (= .cse2 0)) (= (select |#valid| ~head~0.base) 1) (not (= .cse2 .cse1)) (not (= ~head~0.base .cse2)) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= .cse1 0)) (not (= ~head~0.base 0)) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0))))) [2023-11-23 22:28:19,342 INFO L899 garLoopResultBuilder]: For program point L812-3(lines 812 814) no Hoare annotation was computed. [2023-11-23 22:28:19,342 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (and (= ~head~0.offset 0) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_int#1| ~head~0.base) 0) 2) (not (= ~head~0.base 0))) [2023-11-23 22:28:19,342 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point L780(lines 780 786) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point L780-1(lines 780 786) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L895 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (and (= 2 (select (select |#memory_int#1| .cse0) 0)) (= (select |#valid| .cse0) 1) (= ~head~0.offset 0) (= (select |#valid| ~head~0.base) 1) (not (= ~head~0.base .cse0)) (not (= .cse0 0)) (not (= ~head~0.base 0)) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0))) [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point L772-1(line 772) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point L772-3(lines 772 774) no Hoare annotation was computed. [2023-11-23 22:28:19,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 22:28:19,345 INFO L895 garLoopResultBuilder]: At program point L772-5(lines 772 774) the Hoare annotation is: (let ((.cse31 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (let ((.cse33 (select (select |#memory_$Pointer$#1.base| .cse31) 4))) (let ((.cse32 (select (select |#memory_$Pointer$#1.base| .cse33) 4)) (.cse25 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_search_list_~l#1.base|) 4))) (let ((.cse15 (not (= .cse25 0))) (.cse2 (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (.cse3 (= (select (select |#memory_$Pointer$#1.offset| .cse33) 4) 0)) (.cse4 (not (= .cse33 0))) (.cse5 (= (select |#valid| .cse31) 1)) (.cse6 (= ~head~0.offset 0)) (.cse7 (= (select (select |#memory_int#1| .cse32) 0) 2)) (.cse8 (not (= .cse33 .cse32))) (.cse9 (not (= .cse32 0))) (.cse10 (not (= |ULTIMATE.start_search_list_~l#1.base| 0))) (.cse11 (= (select |#valid| ~head~0.base) 1)) (.cse12 (= |ULTIMATE.start_search_list_~k#1| 2)) (.cse13 (not (= .cse32 .cse31))) (.cse14 (not (= ~head~0.base .cse32))) (.cse19 (= (select (select |#memory_$Pointer$#1.offset| .cse31) 4) 0)) (.cse20 (not (= .cse31 0))) (.cse21 (not (= ~head~0.base 0))) (.cse22 (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0))) (or (and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_21| Int)) (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_21|) 4))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (and (not (= .cse0 |v_ULTIMATE.start_search_list_~l#1.base_21|)) (not (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0)) (= .cse1 |ULTIMATE.start_search_list_~l#1.base|) (not (= .cse0 .cse1)) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_search_list_~l#1.base_21|) 4) 0))))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_28| Int)) (let ((.cse16 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4))) (let ((.cse17 (select (select |#memory_$Pointer$#1.base| .cse16) 4))) (let ((.cse18 (select (select |#memory_$Pointer$#1.base| .cse17) 4))) (and (= (select (select |#memory_$Pointer$#1.offset| .cse16) 4) 0) (not (= .cse17 .cse18)) (= .cse16 |ULTIMATE.start_search_list_~l#1.base|) (not (= .cse16 .cse18)) (= (select (select |#memory_int#1| .cse18) 0) 2) (not (= .cse18 |v_ULTIMATE.start_search_list_~l#1.base_28|)) (= (select (select |#memory_$Pointer$#1.offset| .cse17) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4) 0)))))) .cse19 .cse20 .cse21 .cse22) (let ((.cse23 (select (select |#memory_$Pointer$#1.base| .cse25) 4))) (let ((.cse24 (select (select |#memory_$Pointer$#1.base| .cse23) 4))) (and .cse2 .cse3 .cse4 .cse5 (not (= .cse23 0)) .cse6 .cse7 .cse8 .cse9 (not (= .cse24 .cse23)) .cse10 (not (= .cse24 .cse25)) .cse11 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_search_list_~l#1.base|) 4) 0) .cse12 (not (= .cse24 0)) .cse13 .cse14 .cse15 (= (select (select |#memory_$Pointer$#1.offset| .cse23) 4) 0) .cse19 (= (select (select |#memory_$Pointer$#1.offset| .cse25) 4) 0) .cse20 (= (select (select |#memory_int#1| .cse24) 0) 2) .cse21 .cse22))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_21| Int)) (let ((.cse27 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_21|) 4))) (let ((.cse26 (select (select |#memory_$Pointer$#1.base| .cse27) 4))) (and (not (= .cse26 |v_ULTIMATE.start_search_list_~l#1.base_21|)) (not (= (select (select |#memory_$Pointer$#1.base| .cse26) 4) 0)) (= .cse26 |ULTIMATE.start_search_list_~l#1.base|) (not (= .cse26 .cse27)))))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_28| Int)) (let ((.cse28 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4))) (let ((.cse29 (select (select |#memory_$Pointer$#1.base| .cse28) 4))) (let ((.cse30 (select (select |#memory_$Pointer$#1.base| .cse29) 4))) (and (= (select (select |#memory_$Pointer$#1.offset| .cse28) 4) 0) (not (= .cse29 .cse30)) (= .cse29 |ULTIMATE.start_search_list_~l#1.base|) (not (= .cse28 .cse30)) (= (select (select |#memory_int#1| .cse30) 0) 2) (not (= .cse30 |v_ULTIMATE.start_search_list_~l#1.base_28|)) (= (select (select |#memory_$Pointer$#1.offset| .cse29) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4) 0)))))) .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_search_list_~l#1.base|) 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse20 .cse21 .cse22)))))) [2023-11-23 22:28:19,345 INFO L899 garLoopResultBuilder]: For program point L772-6(lines 772 774) no Hoare annotation was computed. [2023-11-23 22:28:19,345 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 781 783) no Hoare annotation was computed. [2023-11-23 22:28:19,346 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (and (not (= .cse0 0)) (= (select |#valid| .cse1) 1) (= ~head~0.offset 0) (not (= .cse0 .cse1)) (= (select |#valid| .cse0) 1) (not (= ~head~0.base .cse0)) (= (select (select |#memory_int#1| .cse0) 0) 2) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= .cse1 0)) (not (= ~head~0.base 0)) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0)))) [2023-11-23 22:28:19,346 INFO L902 garLoopResultBuilder]: At program point L781-3(lines 781 783) the Hoare annotation is: true [2023-11-23 22:28:19,346 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 22:28:19,346 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2023-11-23 22:28:19,346 INFO L902 garLoopResultBuilder]: At program point L819-2(lines 819 821) the Hoare annotation is: true [2023-11-23 22:28:19,346 INFO L899 garLoopResultBuilder]: For program point L819-3(lines 819 821) no Hoare annotation was computed. [2023-11-23 22:28:19,346 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 16) no Hoare annotation was computed. [2023-11-23 22:28:19,346 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 18) no Hoare annotation was computed. [2023-11-23 22:28:19,347 INFO L895 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (and (= ~head~0.offset 0) (or (and (= |ULTIMATE.start_main_~mylist~0#1.base| 0) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0)) (not (= ~head~0.base 0)))) [2023-11-23 22:28:19,347 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2023-11-23 22:28:19,350 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-11-23 22:28:19,352 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:28:19,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_21 : int :: ((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_21) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4]][4] == 0)) && #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4] == ~l!base) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4])) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_21][4] == 0) could not be translated [2023-11-23 22:28:19,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-23 22:28:19,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-23 22:28:19,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 22:28:19,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated [2023-11-23 22:28:19,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0 && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == ~l!base) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0] == 2) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_28)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0) could not be translated [2023-11-23 22:28:19,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-23 22:28:19,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-23 22:28:19,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-11-23 22:28:19,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-23 22:28:19,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-11-23 22:28:19,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated [2023-11-23 22:28:19,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 22:28:19,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~l!base][4] could not be translated [2023-11-23 22:28:19,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,386 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated [2023-11-23 22:28:19,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-11-23 22:28:19,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4]][0] could not be translated [2023-11-23 22:28:19,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-23 22:28:19,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-23 22:28:19,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-23 22:28:19,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_21 : int :: ((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_21) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4]][4] == 0)) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == ~l!base) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4])) could not be translated [2023-11-23 22:28:19,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 22:28:19,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0 && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == ~l!base) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0] == 2) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_28)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0) could not be translated [2023-11-23 22:28:19,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-23 22:28:19,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-23 22:28:19,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-23 22:28:19,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~l!base][0] could not be translated [2023-11-23 22:28:19,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-23 22:28:19,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 22:28:19,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-23 22:28:19,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-23 22:28:19,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-23 22:28:19,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-23 22:28:19,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-11-23 22:28:19,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-23 22:28:19,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-23 22:28:19,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-23 22:28:19,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:28:19 BoogieIcfgContainer [2023-11-23 22:28:19,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:28:19,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:28:19,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:28:19,403 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:28:19,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:27:33" (3/4) ... [2023-11-23 22:28:19,405 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 22:28:19,409 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2023-11-23 22:28:19,415 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-23 22:28:19,416 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-23 22:28:19,416 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 22:28:19,416 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 22:28:19,510 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 22:28:19,511 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/witness.yml [2023-11-23 22:28:19,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:28:19,512 INFO L158 Benchmark]: Toolchain (without parser) took 47253.56ms. Allocated memory was 125.8MB in the beginning and 390.1MB in the end (delta: 264.2MB). Free memory was 86.9MB in the beginning and 277.7MB in the end (delta: -190.9MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,512 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 94.4MB in the end (delta: 86.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:28:19,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.54ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 61.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.09ms. Allocated memory is still 125.8MB. Free memory was 61.6MB in the beginning and 59.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,513 INFO L158 Benchmark]: Boogie Preprocessor took 58.36ms. Allocated memory is still 125.8MB. Free memory was 59.1MB in the beginning and 56.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,514 INFO L158 Benchmark]: RCFGBuilder took 665.91ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 56.4MB in the beginning and 119.7MB in the end (delta: -63.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,514 INFO L158 Benchmark]: TraceAbstraction took 45651.41ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 119.0MB in the beginning and 283.0MB in the end (delta: -164.0MB). Peak memory consumption was 227.6MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,515 INFO L158 Benchmark]: Witness Printer took 109.02ms. Allocated memory is still 390.1MB. Free memory was 283.0MB in the beginning and 277.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 22:28:19,517 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 94.4MB in the end (delta: 86.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.54ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 61.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.09ms. Allocated memory is still 125.8MB. Free memory was 61.6MB in the beginning and 59.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.36ms. Allocated memory is still 125.8MB. Free memory was 59.1MB in the beginning and 56.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 665.91ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 56.4MB in the beginning and 119.7MB in the end (delta: -63.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 45651.41ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 119.0MB in the beginning and 283.0MB in the end (delta: -164.0MB). Peak memory consumption was 227.6MB. Max. memory is 16.1GB. * Witness Printer took 109.02ms. Allocated memory is still 390.1MB. Free memory was 283.0MB in the beginning and 277.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_21 : int :: ((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_21) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4]][4] == 0)) && #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4] == ~l!base) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4])) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_21][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0 && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == ~l!base) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0] == 2) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_28)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_21 : int :: ((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_21) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4]][4] == 0)) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == ~l!base) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_21][4])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0 && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == ~l!base) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0] == 2) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == v_ULTIMATE.start_search_list_~l#1.base_28)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~l!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.5s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 974 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 826 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2631 IncrementalHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 148 mSDtfsCounter, 2631 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 394 SyntacticMatches, 3 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2697 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 26 NumberOfFragments, 1658 HoareAnnotationTreeSize, 14 FomulaSimplifications, 6834 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3811 FormulaSimplificationTreeSizeReductionInter, 12.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 572 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 626 ConstructedInterpolants, 12 QuantifiedInterpolants, 9279 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2766 ConjunctsInSsa, 358 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 383/568 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((k == 2) || (k == 2)) || (k == 2)) || (k == 2)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 812]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-23 22:28:19,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_124499fe-06de-4cdf-869e-f0e2ad9060bd/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE