./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:30:41,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:30:42,012 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:30:42,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:30:42,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:30:42,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:30:42,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:30:42,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:30:42,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:30:42,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:30:42,040 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:30:42,041 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:30:42,041 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:30:42,042 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:30:42,042 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:30:42,043 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:30:42,043 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:30:42,044 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:30:42,044 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:30:42,045 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:30:42,045 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:30:42,046 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:30:42,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:30:42,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:30:42,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:30:42,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:30:42,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:30:42,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:30:42,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:30:42,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:30:42,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:30:42,049 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:30:42,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:30:42,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:30:42,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:30:42,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:30:42,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:30:42,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:30:42,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:30:42,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:30:42,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:30:42,052 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:30:42,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:30:42,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:30:42,052 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:30:42,052 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:30:42,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:30:42,053 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/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_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2023-12-02 19:30:42,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:30:42,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:30:42,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:30:42,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:30:42,273 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:30:42,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-12-02 19:30:45,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:30:45,247 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:30:45,247 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-12-02 19:30:45,261 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/data/667522bf5/aa16efd3f17f4fd9b157285022c4aa08/FLAG14379b27e [2023-12-02 19:30:45,274 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/data/667522bf5/aa16efd3f17f4fd9b157285022c4aa08 [2023-12-02 19:30:45,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:30:45,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:30:45,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:30:45,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:30:45,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:30:45,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f581680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45, skipping insertion in model container [2023-12-02 19:30:45,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,332 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:30:45,610 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_6057b79b-2850-439b-8964-658950e2eb11/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-12-02 19:30:45,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:30:45,625 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:30:45,664 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_6057b79b-2850-439b-8964-658950e2eb11/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-12-02 19:30:45,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:30:45,695 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:30:45,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45 WrapperNode [2023-12-02 19:30:45,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:30:45,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:30:45,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:30:45,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:30:45,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,741 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-12-02 19:30:45,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:30:45,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:30:45,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:30:45,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:30:45,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:30:45,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:30:45,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:30:45,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:30:45,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (1/1) ... [2023-12-02 19:30:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:30:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:45,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:30:45,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:30:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:30:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:30:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 19:30:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:30:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 19:30:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 19:30:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:30:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:30:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:30:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:30:45,948 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:30:45,949 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:30:46,094 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:30:46,155 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:30:46,156 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 19:30:46,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:30:46 BoogieIcfgContainer [2023-12-02 19:30:46,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:30:46,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:30:46,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:30:46,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:30:46,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:30:45" (1/3) ... [2023-12-02 19:30:46,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d608e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:30:46, skipping insertion in model container [2023-12-02 19:30:46,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:30:45" (2/3) ... [2023-12-02 19:30:46,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d608e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:30:46, skipping insertion in model container [2023-12-02 19:30:46,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:30:46" (3/3) ... [2023-12-02 19:30:46,166 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2023-12-02 19:30:46,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:30:46,183 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:30:46,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:30:46,225 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=FINITE_AUTOMATA, 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;@5869f396, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:30:46,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:30:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 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-12-02 19:30:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 19:30:46,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:46,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:46,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:46,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash -556299951, now seen corresponding path program 1 times [2023-12-02 19:30:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232699431] [2023-12-02 19:30:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:46,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:46,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232699431] [2023-12-02 19:30:46,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232699431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:46,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:30:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:30:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966179105] [2023-12-02 19:30:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:46,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:30:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:30:46,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:30:46,529 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-12-02 19:30:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:46,582 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2023-12-02 19:30:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:30:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2023-12-02 19:30:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:46,592 INFO L225 Difference]: With dead ends: 27 [2023-12-02 19:30:46,592 INFO L226 Difference]: Without dead ends: 12 [2023-12-02 19:30:46,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:30:46,599 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:46,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-02 19:30:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-02 19:30:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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-12-02 19:30:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2023-12-02 19:30:46,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2023-12-02 19:30:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:46,647 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-12-02 19:30:46,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-12-02 19:30:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2023-12-02 19:30:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:30:46,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:46,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:30:46,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:46,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1698602241, now seen corresponding path program 1 times [2023-12-02 19:30:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068929938] [2023-12-02 19:30:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:46,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068929938] [2023-12-02 19:30:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068929938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:30:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:30:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225499279] [2023-12-02 19:30:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:46,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:30:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:30:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:30:46,793 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-12-02 19:30:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:46,834 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2023-12-02 19:30:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:30:46,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2023-12-02 19:30:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:46,835 INFO L225 Difference]: With dead ends: 23 [2023-12-02 19:30:46,836 INFO L226 Difference]: Without dead ends: 18 [2023-12-02 19:30:46,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:30:46,838 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:46,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-02 19:30:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2023-12-02 19:30:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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-12-02 19:30:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-12-02 19:30:46,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2023-12-02 19:30:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:46,845 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-12-02 19:30:46,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-12-02 19:30:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2023-12-02 19:30:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:30:46,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:46,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:46,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:30:46,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:46,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 741780862, now seen corresponding path program 1 times [2023-12-02 19:30:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926557458] [2023-12-02 19:30:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:46,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926557458] [2023-12-02 19:30:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926557458] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857622328] [2023-12-02 19:30:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:46,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:46,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:47,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:47,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:30:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:47,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:30:47,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:47,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857622328] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:47,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1229288585] [2023-12-02 19:30:47,205 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 19:30:47,206 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:30:47,209 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:30:47,215 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:30:47,215 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:30:48,109 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:30:48,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1229288585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:48,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:48,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2023-12-02 19:30:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563679800] [2023-12-02 19:30:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:48,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:30:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:30:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:30:48,377 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-02 19:30:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:48,461 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2023-12-02 19:30:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:30:48,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2023-12-02 19:30:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:48,462 INFO L225 Difference]: With dead ends: 21 [2023-12-02 19:30:48,462 INFO L226 Difference]: Without dead ends: 14 [2023-12-02 19:30:48,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:30:48,464 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:48,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:30:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-02 19:30:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-12-02 19:30:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-12-02 19:30:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-12-02 19:30:48,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2023-12-02 19:30:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:48,471 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-12-02 19:30:48,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-12-02 19:30:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-12-02 19:30:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:30:48,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:48,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:48,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:30:48,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:48,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:48,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash 901158905, now seen corresponding path program 1 times [2023-12-02 19:30:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:48,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649153899] [2023-12-02 19:30:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:30:48,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649153899] [2023-12-02 19:30:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649153899] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235424833] [2023-12-02 19:30:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:48,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:48,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:48,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:30:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:48,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:30:48,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:30:48,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:30:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235424833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1600572154] [2023-12-02 19:30:48,906 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 19:30:48,907 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:30:48,907 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:30:48,907 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:30:48,907 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:30:49,412 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:30:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1600572154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:49,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 3] total 12 [2023-12-02 19:30:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675094911] [2023-12-02 19:30:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:49,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 19:30:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 19:30:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=116, Unknown=2, NotChecked=0, Total=156 [2023-12-02 19:30:49,949 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-12-02 19:30:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:50,198 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2023-12-02 19:30:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:30:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 12 [2023-12-02 19:30:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:50,199 INFO L225 Difference]: With dead ends: 24 [2023-12-02 19:30:50,199 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 19:30:50,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=137, Unknown=2, NotChecked=0, Total=182 [2023-12-02 19:30:50,201 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:50,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 13 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:30:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 19:30:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2023-12-02 19:30:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-12-02 19:30:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-02 19:30:50,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2023-12-02 19:30:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:50,209 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-02 19:30:50,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-12-02 19:30:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-02 19:30:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 19:30:50,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:50,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:50,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:30:50,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:50,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:50,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2130497583, now seen corresponding path program 1 times [2023-12-02 19:30:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282181464] [2023-12-02 19:30:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:30:50,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282181464] [2023-12-02 19:30:50,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282181464] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797184320] [2023-12-02 19:30:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:50,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:50,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:50,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:30:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:50,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 19:30:50,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:30:50,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:30:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797184320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787300852] [2023-12-02 19:30:50,626 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 19:30:50,626 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:30:50,626 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:30:50,626 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:30:50,626 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:30:51,250 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:30:51,859 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '482#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|v_ULTIMATE.start_sll_update_at_~head#1.base_39| Int) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (and (= (store |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_update_at_~head#1.base_39| (store (select |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_78| |v_ULTIMATE.start_sll_update_at_~head#1.base_39| (store (select |v_#memory_int_78| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) 3) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_update_at_~head#1.base_39| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_39|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))))) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_sll_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-12-02 19:30:51,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:30:51,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-12-02 19:30:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012434081] [2023-12-02 19:30:51,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:51,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 19:30:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 19:30:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=159, Unknown=1, NotChecked=0, Total=210 [2023-12-02 19:30:51,861 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-12-02 19:30:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:51,939 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-12-02 19:30:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:30:51,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 13 [2023-12-02 19:30:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:51,940 INFO L225 Difference]: With dead ends: 35 [2023-12-02 19:30:51,940 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 19:30:51,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=262, Unknown=1, NotChecked=0, Total=342 [2023-12-02 19:30:51,941 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:51,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 19:30:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2023-12-02 19:30:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-12-02 19:30:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-02 19:30:51,951 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2023-12-02 19:30:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:51,951 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-02 19:30:51,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-12-02 19:30:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-02 19:30:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:30:51,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:51,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:51,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:30:52,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:52,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:52,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2096494752, now seen corresponding path program 2 times [2023-12-02 19:30:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046110506] [2023-12-02 19:30:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:53,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:53,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046110506] [2023-12-02 19:30:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046110506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:53,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408346429] [2023-12-02 19:30:53,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:30:53,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:53,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:53,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:53,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:30:53,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:30:53,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:30:53,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-02 19:30:53,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:53,789 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-12-02 19:30:53,842 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:30:53,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 19:30:53,879 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-12-02 19:30:53,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 19:30:54,053 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 19:30:54,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-12-02 19:30:54,057 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 23 treesize of output 15 [2023-12-02 19:30:54,060 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 32 treesize of output 19 [2023-12-02 19:30:54,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:54,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-12-02 19:30:54,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 19:30:54,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:54,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-02 19:30:54,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-02 19:30:54,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 19:30:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:54,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:54,387 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 Int) (v_ArrVal_265 Int) (v_ArrVal_267 (Array Int Int))) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_267) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_266)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_265)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2023-12-02 19:30:54,408 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 Int) (v_ArrVal_265 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_267 (Array Int Int))) (or (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_267) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_266) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_265) .cse0))) 1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2023-12-02 19:30:54,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:54,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2023-12-02 19:30:54,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:54,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 101 [2023-12-02 19:30:54,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 19:30:54,996 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_265 Int) (v_ArrVal_264 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_265) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_266 Int) (v_ArrVal_262 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_266) .cse1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_266 Int) (v_ArrVal_262 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_266) .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|)))))) is different from false [2023-12-02 19:30:55,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_265 Int) (v_ArrVal_264 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_264) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_265) .cse0))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (forall ((v_ArrVal_266 Int) (v_ArrVal_262 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_262) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_266) .cse0) .cse1)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (forall ((v_ArrVal_266 Int) (v_ArrVal_262 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_262) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_266) .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))))) is different from false [2023-12-02 19:30:55,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:55,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 19:30:55,066 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 42 treesize of output 38 [2023-12-02 19:30:55,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:30:55,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:30:55,076 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:30:55,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 19:30:55,086 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 19:30:55,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2023-12-02 19:30:55,092 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-02 19:30:55,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2023-12-02 19:30:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-12-02 19:30:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408346429] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276539899] [2023-12-02 19:30:55,190 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 19:30:55,190 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:30:55,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:30:55,190 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:30:55,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:30:55,847 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:30:56,891 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '723#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_sll_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_52| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_52| Int)) (and (= |#memory_int| (store |v_#memory_int_95| |v_ULTIMATE.start_sll_update_at_~head#1.base_52| (store (select |v_#memory_int_95| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_sll_update_at_~head#1.base_52| (store (select |v_#memory_$Pointer$.offset_86| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|) 3) (= (store |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_sll_update_at_~head#1.base_52| (store (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_52|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_52|))) |#memory_$Pointer$.base|))) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-12-02 19:30:56,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:30:56,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 39 [2023-12-02 19:30:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202425264] [2023-12-02 19:30:56,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:56,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 19:30:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 19:30:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1645, Unknown=30, NotChecked=340, Total=2162 [2023-12-02 19:30:56,893 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 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-12-02 19:30:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:57,657 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-12-02 19:30:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:30:57,658 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 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) Word has length 17 [2023-12-02 19:30:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:57,658 INFO L225 Difference]: With dead ends: 40 [2023-12-02 19:30:57,658 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 19:30:57,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=244, Invalid=2392, Unknown=32, NotChecked=412, Total=3080 [2023-12-02 19:30:57,660 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:57,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 66 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 179 Unchecked, 0.3s Time] [2023-12-02 19:30:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 19:30:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2023-12-02 19:30:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-12-02 19:30:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-02 19:30:57,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2023-12-02 19:30:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:57,672 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-02 19:30:57,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 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-12-02 19:30:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-02 19:30:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:30:57,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:57,673 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:57,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 19:30:57,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:57,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:57,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -568480438, now seen corresponding path program 3 times [2023-12-02 19:30:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84305586] [2023-12-02 19:30:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 19:30:57,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84305586] [2023-12-02 19:30:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84305586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:30:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:30:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848301807] [2023-12-02 19:30:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:57,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:30:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:30:57,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:30:57,987 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-12-02 19:30:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:58,039 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-12-02 19:30:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:30:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 18 [2023-12-02 19:30:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:58,041 INFO L225 Difference]: With dead ends: 33 [2023-12-02 19:30:58,041 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 19:30:58,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:30:58,042 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:58,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 19:30:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-02 19:30:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-12-02 19:30:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-12-02 19:30:58,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2023-12-02 19:30:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:58,056 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-12-02 19:30:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-12-02 19:30:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-12-02 19:30:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:30:58,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:58,057 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:58,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 19:30:58,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:58,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1762034141, now seen corresponding path program 4 times [2023-12-02 19:30:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:58,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367043827] [2023-12-02 19:30:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:30:58,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367043827] [2023-12-02 19:30:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367043827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:58,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:30:58,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:30:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400301036] [2023-12-02 19:30:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:58,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:30:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:58,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:30:58,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:30:58,163 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-12-02 19:30:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:58,238 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-12-02 19:30:58,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:30:58,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 18 [2023-12-02 19:30:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:58,241 INFO L225 Difference]: With dead ends: 42 [2023-12-02 19:30:58,241 INFO L226 Difference]: Without dead ends: 32 [2023-12-02 19:30:58,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:30:58,242 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:58,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:58,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-02 19:30:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-02 19:30:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-12-02 19:30:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-02 19:30:58,256 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2023-12-02 19:30:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:58,256 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-02 19:30:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-12-02 19:30:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-02 19:30:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:30:58,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:58,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:58,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 19:30:58,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:58,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -154461505, now seen corresponding path program 5 times [2023-12-02 19:30:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702838365] [2023-12-02 19:30:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 19:30:58,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:58,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702838365] [2023-12-02 19:30:58,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702838365] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:58,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438367026] [2023-12-02 19:30:58,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:30:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:58,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:58,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:30:58,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:30:58,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:30:58,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:30:58,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 19:30:58,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:30:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438367026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:30:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-12-02 19:30:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449766421] [2023-12-02 19:30:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:58,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:30:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:30:58,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:30:58,728 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-12-02 19:30:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:58,774 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-02 19:30:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:30:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 18 [2023-12-02 19:30:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:58,774 INFO L225 Difference]: With dead ends: 34 [2023-12-02 19:30:58,774 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 19:30:58,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:30:58,775 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:58,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 19:30:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-02 19:30:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-12-02 19:30:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-12-02 19:30:58,784 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2023-12-02 19:30:58,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:58,784 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-12-02 19:30:58,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-12-02 19:30:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-12-02 19:30:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:30:58,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:58,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:58,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:30:58,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:58,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:30:58,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash 765874369, now seen corresponding path program 1 times [2023-12-02 19:30:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:58,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892513683] [2023-12-02 19:30:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:30:59,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892513683] [2023-12-02 19:30:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892513683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502286814] [2023-12-02 19:30:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:59,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:59,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:59,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:59,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:30:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:59,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 19:30:59,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:59,566 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-12-02 19:30:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:30:59,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:59,720 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 36 treesize of output 32 [2023-12-02 19:30:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 19:30:59,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502286814] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:59,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [584212408] [2023-12-02 19:30:59,791 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 19:30:59,791 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:30:59,791 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:30:59,791 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:30:59,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:31:00,350 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:31:01,212 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1408#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~ret15#1_32| Int)) (and (not (= |v_ULTIMATE.start_main_#t~ret15#1_32| |ULTIMATE.start_main_~expected~0#1|)) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |v_ULTIMATE.start_main_#t~ret15#1_32| |ULTIMATE.start_sll_get_data_at_#res#1|) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int) (|v_#memory_int_117| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_63| Int)) (and (= |#memory_int| (store |v_#memory_int_117| |v_ULTIMATE.start_sll_update_at_~head#1.base_63| (store (select |v_#memory_int_117| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|) 3) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|))))))) (and (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |v_ULTIMATE.start_main_#t~ret15#1_32| |ULTIMATE.start_sll_get_data_at_#res#1|) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_63| Int) (|v_#memory_int_117| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.base_63| Int)) (and (= |#memory_int| (store |v_#memory_int_117| |v_ULTIMATE.start_sll_update_at_~head#1.base_63| (store (select |v_#memory_int_117| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|) 3) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63| (store (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_63|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_63|)))))))))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-12-02 19:31:01,212 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:31:01,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:31:01,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2023-12-02 19:31:01,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023748540] [2023-12-02 19:31:01,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:31:01,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 19:31:01,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:31:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 19:31:01,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2023-12-02 19:31:01,214 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 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-12-02 19:31:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:31:01,434 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-02 19:31:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 19:31:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 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) Word has length 20 [2023-12-02 19:31:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:31:01,435 INFO L225 Difference]: With dead ends: 27 [2023-12-02 19:31:01,435 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 19:31:01,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 19:31:01,437 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:31:01,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:31:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 19:31:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-12-02 19:31:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-12-02 19:31:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-12-02 19:31:01,444 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2023-12-02 19:31:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:31:01,444 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-12-02 19:31:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 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-12-02 19:31:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-12-02 19:31:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:31:01,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:31:01,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:31:01,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:31:01,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:01,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:31:01,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:31:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2029350903, now seen corresponding path program 2 times [2023-12-02 19:31:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:31:01,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973859374] [2023-12-02 19:31:01,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:01,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:31:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 19:31:01,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:31:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973859374] [2023-12-02 19:31:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973859374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:31:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046267310] [2023-12-02 19:31:01,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:31:01,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:01,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:31:01,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:31:01,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:31:01,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 19:31:01,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:31:01,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 19:31:01,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:31:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 19:31:01,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:31:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 19:31:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046267310] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:31:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1271245709] [2023-12-02 19:31:01,948 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 19:31:01,948 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:31:01,948 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:31:01,948 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:31:01,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:31:02,609 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:31:03,154 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1633#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~ret15#1_38| Int)) (and (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (exists ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_73| Int) (|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int)))) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|) 3) (= |#memory_int| (store |v_#memory_int_132| |v_ULTIMATE.start_sll_update_at_~head#1.base_73| (store (select |v_#memory_int_132| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73| (store (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73| (store (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))))) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |v_ULTIMATE.start_main_#t~ret15#1_38| |ULTIMATE.start_sll_get_data_at_#res#1|)) (and (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (exists ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_73| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_73| Int) (|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int)))) (and (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|) 3) (= |#memory_int| (store |v_#memory_int_132| |v_ULTIMATE.start_sll_update_at_~head#1.base_73| (store (select |v_#memory_int_132| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73| (store (select |v_#memory_$Pointer$.base_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73| (store (select |v_#memory_$Pointer$.offset_122| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_73|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_73|)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |v_ULTIMATE.start_main_#t~ret15#1_38| |ULTIMATE.start_sll_get_data_at_#res#1|))) (not (= |v_ULTIMATE.start_main_#t~ret15#1_38| |ULTIMATE.start_main_~expected~0#1|)))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2023-12-02 19:31:03,154 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:31:03,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:31:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-12-02 19:31:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49311525] [2023-12-02 19:31:03,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:31:03,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:31:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:31:03,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:31:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-02 19:31:03,156 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-12-02 19:31:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:31:03,220 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-12-02 19:31:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:31:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 21 [2023-12-02 19:31:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:31:03,220 INFO L225 Difference]: With dead ends: 26 [2023-12-02 19:31:03,220 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 19:31:03,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-12-02 19:31:03,221 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:31:03,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:31:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 19:31:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 19:31:03,222 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-12-02 19:31:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 19:31:03,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-12-02 19:31:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:31:03,222 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 19:31:03,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-12-02 19:31:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 19:31:03,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 19:31:03,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 19:31:03,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:31:03,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:03,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 19:31:04,280 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 19:31:04,280 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (and (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select .cse1 0) 2) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_30| Int) (|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (and (<= .cse2 3) (= |#memory_int| (store |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| .cse2))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) (= (store |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) |#memory_$Pointer$.base|)))) .cse3 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and (= (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|) 2) (<= |ULTIMATE.start_main_~i~0#1| 0) .cse3))) [2023-12-02 19:31:04,280 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 613 632) no Hoare annotation was computed. [2023-12-02 19:31:04,281 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|)) (.cse3 (= 3 |ULTIMATE.start_sll_update_at_~data#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (<= 1 |#StackHeapBarrier|)) (.cse13 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse2 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse14))) (.cse12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse5 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_sll_update_at_~head#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse10 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse16 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse17 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_sll_update_at_~index#1| 1) .cse3 .cse4 (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse5 (= 3 |ULTIMATE.start_main_~new_data~0#1|) .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_sll_update_at_#in~index#1| 1) .cse10 (= 3 |ULTIMATE.start_sll_update_at_#in~data#1|) .cse11) (and .cse0 .cse1 (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse12) .cse13 (not .cse10) .cse3 .cse4 .cse5 (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse14) .cse6 .cse7 .cse9 .cse15 .cse16 .cse17 .cse11) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse13 .cse2 (= (select (select |#memory_int| .cse14) .cse12) 3) .cse5 .cse6 .cse7 (= 2 |ULTIMATE.start_sll_update_at_~data#1|) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_30| Int) (|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (and (<= .cse18 3) (= |#memory_int| (store |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| .cse18))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) (= (store |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) |#memory_$Pointer$.base|)))) .cse8 .cse9 .cse15 .cse10 .cse16 .cse17 .cse11)))) [2023-12-02 19:31:04,281 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2023-12-02 19:31:04,281 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 19:31:04,281 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse1 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse7 (= (select .cse1 0) 2)) (.cse8 (= (select (select |#memory_int| .cse4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|) 2) (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= .cse2 2) .cse3) (and .cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse4)) .cse5 .cse6 .cse7 .cse8 (= .cse2 3) .cse3 .cse9) (and (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) 4))) .cse5 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) .cse6 .cse7 .cse8 (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_30| Int) (|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (and (<= .cse10 3) (= |#memory_int| (store |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| .cse10))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) (= (store |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) |#memory_$Pointer$.base|)))) .cse3 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) (= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse9)))) [2023-12-02 19:31:04,281 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 19:31:04,281 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-12-02 19:31:04,281 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse10))) (.cse6 (= (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 3)) (.cse2 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int) (|v_ULTIMATE.start_sll_update_at_~head#1.base_30| Int) (|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |#memory_int| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (and (<= .cse9 3) (= |#memory_int| (store |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_int_67| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| .cse9))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) (= (store |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30| (store (select |v_#memory_$Pointer$.base_57| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_update_at_~head#1.base_30|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) |#memory_$Pointer$.base|))))) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 0) 2) .cse6 .cse2 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse6 .cse2 .cse3 .cse7 .cse4 .cse8 .cse5)))) [2023-12-02 19:31:04,281 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_sll_create_~len#1|)) (.cse8 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse9 (and (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)))) (let ((.cse1 (<= 1 |#StackHeapBarrier|)) (.cse10 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse3 (= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse11 (or (and .cse0 .cse8) .cse9)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse7 (= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse12 (<= |ULTIMATE.start_sll_create_~len#1| 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse9)) (and .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse12) (and .cse1 .cse10 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse12)))) [2023-12-02 19:31:04,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-12-02 19:31:04,282 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 19:31:04,282 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 613 632) no Hoare annotation was computed. [2023-12-02 19:31:04,284 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2023-12-02 19:31:04,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:31:04,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-12-02 19:31:04,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-12-02 19:31:04,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 19:31:04,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated [2023-12-02 19:31:04,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 19:31:04,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-12-02 19:31:04,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-02 19:31:04,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 19:31:04,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-12-02 19:31:04,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 19:31:04,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated [2023-12-02 19:31:04,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:31:04,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:31:04,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated [2023-12-02 19:31:04,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:31:04,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:31:04,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:31:04,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-12-02 19:31:04,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-12-02 19:31:04,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated [2023-12-02 19:31:04,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:31:04,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated [2023-12-02 19:31:04,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:31:04,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 19:31:04,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated [2023-12-02 19:31:04,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-12-02 19:31:04,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 19:31:04,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 19:31:04,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:31:04,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:31:04,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:31:04,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:31:04,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated [2023-12-02 19:31:04,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:31:04,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:31:04,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:31:04,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 19:31:04,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated [2023-12-02 19:31:04,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated [2023-12-02 19:31:04,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 19:31:04,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 19:31:04,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:31:04 BoogieIcfgContainer [2023-12-02 19:31:04,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:31:04,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:31:04,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:31:04,324 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:31:04,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:30:46" (3/4) ... [2023-12-02 19:31:04,326 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 19:31:04,334 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-12-02 19:31:04,334 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-12-02 19:31:04,335 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 19:31:04,335 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 19:31:04,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || ((((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) || (((((((1 <= len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) [2023-12-02 19:31:04,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((index == 1) && (3 == data)) && (data == 1)) && (\old(index) == 1)) && (3 == \old(data))) || (((((\old(data) <= 3) && (3 == data)) && (data == 1)) && (index == 0)) && (\old(index) <= 1))) || (((((\old(data) <= 3) && (data == 1)) && (2 == data)) && (index == 0)) && (\old(index) <= 1))) [2023-12-02 19:31:04,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((index <= 0) || (index <= 0)) || ((\old(index) == 1) && (index == 1))) [2023-12-02 19:31:04,380 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || ((((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) || (((((((1 <= len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) [2023-12-02 19:31:04,383 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((index == 1) && (3 == data)) && (data == 1)) && (\old(index) == 1)) && (3 == \old(data))) || (((((\old(data) <= 3) && (3 == data)) && (data == 1)) && (index == 0)) && (\old(index) <= 1))) || (((((\old(data) <= 3) && (data == 1)) && (2 == data)) && (index == 0)) && (\old(index) <= 1))) [2023-12-02 19:31:04,383 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((index <= 0) || (index <= 0)) || ((\old(index) == 1) && (index == 1))) [2023-12-02 19:31:04,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 19:31:04,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 19:31:04,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:31:04,422 INFO L158 Benchmark]: Toolchain (without parser) took 19145.14ms. Allocated memory was 201.3MB in the beginning and 320.9MB in the end (delta: 119.5MB). Free memory was 156.4MB in the beginning and 215.7MB in the end (delta: -59.4MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2023-12-02 19:31:04,422 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:31:04,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.71ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 138.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 19:31:04,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.71ms. Allocated memory is still 201.3MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:31:04,423 INFO L158 Benchmark]: Boogie Preprocessor took 31.95ms. Allocated memory is still 201.3MB. Free memory was 136.0MB in the beginning and 134.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:31:04,423 INFO L158 Benchmark]: RCFGBuilder took 382.03ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 115.9MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 19:31:04,424 INFO L158 Benchmark]: TraceAbstraction took 18163.03ms. Allocated memory was 201.3MB in the beginning and 320.9MB in the end (delta: 119.5MB). Free memory was 115.7MB in the beginning and 222.0MB in the end (delta: -106.4MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. [2023-12-02 19:31:04,424 INFO L158 Benchmark]: Witness Printer took 97.82ms. Allocated memory is still 320.9MB. Free memory was 221.0MB in the beginning and 215.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 19:31:04,426 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.15ms. Allocated memory is still 100.7MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.71ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 138.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.71ms. Allocated memory is still 201.3MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.95ms. Allocated memory is still 201.3MB. Free memory was 136.0MB in the beginning and 134.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.03ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 115.9MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18163.03ms. Allocated memory was 201.3MB in the beginning and 320.9MB in the end (delta: 119.5MB). Free memory was 115.7MB in the beginning and 222.0MB in the end (delta: -106.4MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. * Witness Printer took 97.82ms. Allocated memory is still 320.9MB. Free memory was 221.0MB in the beginning and 215.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset 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: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!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: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][4]][#memory_$Pointer$.offset[~s~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_67 : [int,int]int, v_#memory_$Pointer$.offset_57 : [int,int]int, v_ULTIMATE.start_sll_update_at_~head#1.offset_30 : int, v_ULTIMATE.start_sll_update_at_~head#1.base_30 : int, v_#memory_$Pointer$.base_57 : [int,int]int :: ((#memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30] <= 3 && #memory_int == v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_int_67[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_int[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.offset_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.offset[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]]) && v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30 := v_#memory_$Pointer$.base_57[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30 := #memory_$Pointer$.base[v_ULTIMATE.start_sll_update_at_~head#1.base_30][v_ULTIMATE.start_sll_update_at_~head#1.offset_30]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 * 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: 630]: 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 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 179 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 907 IncrementalHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 51 mSDtfsCounter, 907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 207 SyntacticMatches, 12 SemanticMatches, 165 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=7, InterpolantAutomatonStates: 81, 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, 11 MinimizatonAttempts, 35 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 20 NumberOfFragments, 940 HoareAnnotationTreeSize, 6 FomulaSimplifications, 2000 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 346 ConstructedInterpolants, 6 QuantifiedInterpolants, 2062 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1596 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 147/215 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: OVERALL_TIME: 1.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 37, TOOLS_POST_TIME: 1.0s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 35, TOOLS_QUANTIFIERELIM_TIME: 1.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 78, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.2s, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 1.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 242, DAG_COMPRESSION_RETAINED_NODES: 66, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ((((i == 1) && (data == 1)) && (len == 2)) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((2 == len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) || ((((((2 == \old(len)) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) || (((((((1 <= len) && (2 == \old(len))) && (data == 1)) && (len == 2)) && (data == 1)) && (\old(data) == 1)) && (len <= 2))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((i == 1) && (data == 1)) && (len == 2)) || ((((i <= 0) && (data == 1)) && (len == 2)) && (new_data <= 3))) || ((((i == 0) && (data == 1)) && (len == 2)) && (new_data <= 3))) - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: (((index <= 0) || (index <= 0)) || ((\old(index) == 1) && (index == 1))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((((index == 1) && (3 == data)) && (data == 1)) && (\old(index) == 1)) && (3 == \old(data))) || (((((\old(data) <= 3) && (3 == data)) && (data == 1)) && (index == 0)) && (\old(index) <= 1))) || (((((\old(data) <= 3) && (data == 1)) && (2 == data)) && (index == 0)) && (\old(index) <= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-02 19:31:04,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6057b79b-2850-439b-8964-658950e2eb11/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE