./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/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_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:35:49,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:35:49,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 14:35:49,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:35:49,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:35:49,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:35:49,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:35:49,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:35:49,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:35:49,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:35:49,344 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:35:49,345 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:35:49,345 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:35:49,346 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:35:49,346 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:35:49,347 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:35:49,347 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:35:49,348 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:35:49,348 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:35:49,349 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:35:49,349 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:35:49,350 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:35:49,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:35:49,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:35:49,352 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:35:49,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:35:49,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:35:49,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:35:49,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:35:49,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:35:49,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:35:49,355 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 14:35:49,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:35:49,355 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:35:49,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:35:49,356 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:35:49,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:35:49,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:35:49,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:35:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:35:49,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:35:49,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:35:49,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:35:49,358 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:35:49,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:35:49,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:35:49,358 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:35:49,358 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:35:49,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:35:49,359 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_57354bc8-7082-4dde-8b41-c00450cd6a31/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_57354bc8-7082-4dde-8b41-c00450cd6a31/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 ! overflow) ) 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2023-12-02 14:35:49,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:35:49,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:35:49,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:35:49,618 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:35:49,619 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:35:49,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-12-02 14:35:52,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:35:52,688 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:35:52,688 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2023-12-02 14:35:52,701 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/data/60ede335e/9fc9a0221ea3474ca1586323a1ab4928/FLAG46dd547e7 [2023-12-02 14:35:52,715 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/data/60ede335e/9fc9a0221ea3474ca1586323a1ab4928 [2023-12-02 14:35:52,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:35:52,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:35:52,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:35:52,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:35:52,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:35:52,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:35:52" (1/1) ... [2023-12-02 14:35:52,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668b1f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:52, skipping insertion in model container [2023-12-02 14:35:52,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:35:52" (1/1) ... [2023-12-02 14:35:52,776 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:35:53,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:35:53,057 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:35:53,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:35:53,128 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:35:53,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53 WrapperNode [2023-12-02 14:35:53,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:35:53,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:35:53,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:35:53,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:35:53,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,174 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2023-12-02 14:35:53,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:35:53,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:35:53,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:35:53,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:35:53,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:35:53,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:35:53,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:35:53,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:35:53,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (1/1) ... [2023-12-02 14:35:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:35:53,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:35:53,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:35:53,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:35:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 14:35:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 14:35:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 14:35:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 14:35:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:35:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:35:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:35:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:35:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:35:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:35:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:35:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:35:53,424 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:35:53,426 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:35:53,670 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:35:53,736 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:35:53,736 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 14:35:53,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:35:53 BoogieIcfgContainer [2023-12-02 14:35:53,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:35:53,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:35:53,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:35:53,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:35:53,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:35:52" (1/3) ... [2023-12-02 14:35:53,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdd03b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:35:53, skipping insertion in model container [2023-12-02 14:35:53,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:53" (2/3) ... [2023-12-02 14:35:53,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdd03b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:35:53, skipping insertion in model container [2023-12-02 14:35:53,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:35:53" (3/3) ... [2023-12-02 14:35:53,748 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2023-12-02 14:35:53,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:35:53,769 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-12-02 14:35:53,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:35:53,820 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;@223a2b84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:35:53,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-12-02 14:35:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 14:35:53,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:53,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:53,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:53,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1378576435, now seen corresponding path program 1 times [2023-12-02 14:35:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321179426] [2023-12-02 14:35:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:54,161 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 14:35:54,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:54,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321179426] [2023-12-02 14:35:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321179426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:54,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:54,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:35:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22366145] [2023-12-02 14:35:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:54,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:35:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:35:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:35:54,201 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:35:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:54,263 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2023-12-02 14:35:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:35:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-12-02 14:35:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:54,272 INFO L225 Difference]: With dead ends: 105 [2023-12-02 14:35:54,272 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 14:35:54,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:35:54,279 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:54,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 101 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:35:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 14:35:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-12-02 14:35:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-12-02 14:35:54,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2023-12-02 14:35:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:54,319 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-12-02 14:35:54,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:35:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-12-02 14:35:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 14:35:54,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:54,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:54,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:35:54,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:54,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -159460345, now seen corresponding path program 1 times [2023-12-02 14:35:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869234700] [2023-12-02 14:35:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 14:35:54,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869234700] [2023-12-02 14:35:54,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869234700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:35:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807597424] [2023-12-02 14:35:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:54,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:35:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:35:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:35:54,482 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:54,541 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-12-02 14:35:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:35:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2023-12-02 14:35:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:54,543 INFO L225 Difference]: With dead ends: 57 [2023-12-02 14:35:54,543 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 14:35:54,544 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 14:35:54,545 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:54,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 129 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:35:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 14:35:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-02 14:35:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:35:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2023-12-02 14:35:54,554 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2023-12-02 14:35:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:54,554 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2023-12-02 14:35:54,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2023-12-02 14:35:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 14:35:54,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:54,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:54,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:35:54,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:54,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash -249254770, now seen corresponding path program 1 times [2023-12-02 14:35:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:54,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312869476] [2023-12-02 14:35:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:54,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312869476] [2023-12-02 14:35:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312869476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:54,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:54,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:35:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119102716] [2023-12-02 14:35:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:54,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:35:54,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:35:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:35:54,654 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:54,696 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-12-02 14:35:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:35:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2023-12-02 14:35:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:54,698 INFO L225 Difference]: With dead ends: 55 [2023-12-02 14:35:54,698 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 14:35:54,698 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 14:35:54,700 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:54,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:35:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 14:35:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-02 14:35:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:35:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-12-02 14:35:54,710 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2023-12-02 14:35:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:54,710 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-12-02 14:35:54,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-12-02 14:35:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 14:35:54,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:54,712 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:54,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:35:54,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:54,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 449660559, now seen corresponding path program 1 times [2023-12-02 14:35:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130707034] [2023-12-02 14:35:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:54,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130707034] [2023-12-02 14:35:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130707034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:35:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175499617] [2023-12-02 14:35:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:54,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:35:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:54,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:35:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:35:54,816 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:54,891 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-12-02 14:35:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:35:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-02 14:35:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:54,893 INFO L225 Difference]: With dead ends: 69 [2023-12-02 14:35:54,893 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 14:35:54,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:35:54,895 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:54,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:35:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 14:35:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-02 14:35:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:35:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2023-12-02 14:35:54,905 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2023-12-02 14:35:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:54,906 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2023-12-02 14:35:54,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2023-12-02 14:35:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 14:35:54,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:54,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:54,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 14:35:54,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:54,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1054575512, now seen corresponding path program 1 times [2023-12-02 14:35:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:54,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400966122] [2023-12-02 14:35:54,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:55,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400966122] [2023-12-02 14:35:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400966122] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:35:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581920472] [2023-12-02 14:35:55,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:55,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:35:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:35:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:35:55,024 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:55,092 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2023-12-02 14:35:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:35:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-12-02 14:35:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:55,094 INFO L225 Difference]: With dead ends: 76 [2023-12-02 14:35:55,094 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 14:35:55,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:35:55,096 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 84 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:55,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 56 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:35:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 14:35:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2023-12-02 14:35:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 14:35:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2023-12-02 14:35:55,106 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 20 [2023-12-02 14:35:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:55,107 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2023-12-02 14:35:55,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2023-12-02 14:35:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 14:35:55,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:55,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:55,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:35:55,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:55,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1878593676, now seen corresponding path program 1 times [2023-12-02 14:35:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531556121] [2023-12-02 14:35:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:55,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 14:35:55,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531556121] [2023-12-02 14:35:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531556121] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:35:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007579309] [2023-12-02 14:35:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:55,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:35:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:35:55,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:35:55,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:35:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:55,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:35:55,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:35:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 14:35:55,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:35:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007579309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:55,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:35:55,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 14:35:55,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076957718] [2023-12-02 14:35:55,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:55,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:35:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:35:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:35:55,467 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 14:35:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:55,516 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2023-12-02 14:35:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:35:55,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-12-02 14:35:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:55,518 INFO L225 Difference]: With dead ends: 96 [2023-12-02 14:35:55,518 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 14:35:55,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:35:55,519 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:55,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:35:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 14:35:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-02 14:35:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-12-02 14:35:55,528 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2023-12-02 14:35:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:55,528 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-12-02 14:35:55,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 14:35:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-12-02 14:35:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 14:35:55,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:55,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:55,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:35:55,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 14:35:55,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:55,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash -165212262, now seen corresponding path program 1 times [2023-12-02 14:35:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958806527] [2023-12-02 14:35:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:55,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958806527] [2023-12-02 14:35:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958806527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:35:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922038969] [2023-12-02 14:35:55,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:55,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:35:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:55,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:35:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:35:55,788 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:55,814 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-12-02 14:35:55,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:35:55,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-02 14:35:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:55,815 INFO L225 Difference]: With dead ends: 49 [2023-12-02 14:35:55,815 INFO L226 Difference]: Without dead ends: 48 [2023-12-02 14:35:55,816 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 14:35:55,817 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:55,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:35:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-02 14:35:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-02 14:35:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-12-02 14:35:55,824 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2023-12-02 14:35:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:55,824 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-12-02 14:35:55,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-12-02 14:35:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 14:35:55,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:55,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 14:35:55,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:55,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -165208003, now seen corresponding path program 1 times [2023-12-02 14:35:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657638855] [2023-12-02 14:35:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:55,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657638855] [2023-12-02 14:35:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657638855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:55,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:55,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:35:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448014696] [2023-12-02 14:35:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:55,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:35:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:55,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:35:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:35:55,891 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:55,941 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2023-12-02 14:35:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:35:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-02 14:35:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:55,942 INFO L225 Difference]: With dead ends: 48 [2023-12-02 14:35:55,942 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 14:35:55,942 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 14:35:55,943 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:55,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:35:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 14:35:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 14:35:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-12-02 14:35:55,967 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 22 [2023-12-02 14:35:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:55,967 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-12-02 14:35:55,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-12-02 14:35:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:35:55,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:55,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:55,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 14:35:55,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:55,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash -826612742, now seen corresponding path program 1 times [2023-12-02 14:35:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979166991] [2023-12-02 14:35:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:56,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979166991] [2023-12-02 14:35:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979166991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:56,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:35:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229074736] [2023-12-02 14:35:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:56,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:35:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:35:56,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:35:56,073 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:56,183 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-12-02 14:35:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:35:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-02 14:35:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:56,184 INFO L225 Difference]: With dead ends: 64 [2023-12-02 14:35:56,185 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 14:35:56,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:35:56,186 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:56,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 91 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:35:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 14:35:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2023-12-02 14:35:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-12-02 14:35:56,192 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 23 [2023-12-02 14:35:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:56,193 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-12-02 14:35:56,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-12-02 14:35:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 14:35:56,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:56,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:56,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 14:35:56,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:56,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash -826480701, now seen corresponding path program 1 times [2023-12-02 14:35:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:56,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838533866] [2023-12-02 14:35:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:56,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838533866] [2023-12-02 14:35:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838533866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:35:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644433749] [2023-12-02 14:35:56,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:56,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:35:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:35:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:35:56,282 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:56,363 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2023-12-02 14:35:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:35:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-02 14:35:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:56,364 INFO L225 Difference]: With dead ends: 60 [2023-12-02 14:35:56,364 INFO L226 Difference]: Without dead ends: 58 [2023-12-02 14:35:56,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:35:56,365 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:56,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 83 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:35:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-02 14:35:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2023-12-02 14:35:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-02 14:35:56,373 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 23 [2023-12-02 14:35:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:56,373 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-02 14:35:56,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-02 14:35:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 14:35:56,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:56,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:56,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 14:35:56,375 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:56,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1389710800, now seen corresponding path program 1 times [2023-12-02 14:35:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724049024] [2023-12-02 14:35:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 14:35:56,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724049024] [2023-12-02 14:35:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724049024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:35:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:35:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:35:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545861331] [2023-12-02 14:35:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:35:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:35:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:35:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:35:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:35:56,478 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:35:56,562 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2023-12-02 14:35:56,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:35:56,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-12-02 14:35:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:35:56,564 INFO L225 Difference]: With dead ends: 89 [2023-12-02 14:35:56,564 INFO L226 Difference]: Without dead ends: 61 [2023-12-02 14:35:56,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:35:56,565 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:35:56,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 61 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:35:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-02 14:35:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2023-12-02 14:35:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:35:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-12-02 14:35:56,572 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2023-12-02 14:35:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:35:56,572 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-12-02 14:35:56,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:35:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-12-02 14:35:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 14:35:56,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:35:56,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:35:56,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 14:35:56,574 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:35:56,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:35:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash -254393426, now seen corresponding path program 1 times [2023-12-02 14:35:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:35:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430207731] [2023-12-02 14:35:56,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:35:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:35:56,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:35:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430207731] [2023-12-02 14:35:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430207731] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:35:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383693417] [2023-12-02 14:35:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:35:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:35:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:35:56,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:35:56,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:35:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:35:56,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:35:56,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:35:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:35:56,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:35:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:35:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383693417] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:35:57,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1547476767] [2023-12-02 14:35:57,085 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 14:35:57,085 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:35:57,089 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:35:57,095 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:35:57,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:35:58,642 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 14:35:58,669 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:36:00,343 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1973#(and (= |ULTIMATE.start_sll_circular_update_at_#t~post13#1| |ULTIMATE.start_sll_circular_update_at_~index#1|) (exists ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_35| Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.base_35| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.base_35|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_35|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_update_at_~head#1.base_35|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_35|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (<= |ULTIMATE.start_main_~len~0#1| 2147483647) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 2147483649 |ULTIMATE.start_sll_circular_update_at_#t~post13#1|))' at error location [2023-12-02 14:36:00,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 14:36:00,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:36:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-12-02 14:36:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824822133] [2023-12-02 14:36:00,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:36:00,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 14:36:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:36:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 14:36:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2023-12-02 14:36:00,346 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 14:36:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:36:00,495 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-12-02 14:36:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 14:36:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-02 14:36:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:36:00,496 INFO L225 Difference]: With dead ends: 86 [2023-12-02 14:36:00,496 INFO L226 Difference]: Without dead ends: 58 [2023-12-02 14:36:00,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2023-12-02 14:36:00,498 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:36:00,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 110 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:36:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-02 14:36:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2023-12-02 14:36:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:36:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-12-02 14:36:00,503 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 32 [2023-12-02 14:36:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:36:00,504 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-12-02 14:36:00,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 14:36:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-12-02 14:36:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 14:36:00,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:36:00,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:36:00,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 14:36:00,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 14:36:00,709 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:36:00,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:36:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash 777098428, now seen corresponding path program 1 times [2023-12-02 14:36:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:36:00,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88996791] [2023-12-02 14:36:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:36:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:36:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:36:00,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:36:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88996791] [2023-12-02 14:36:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88996791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:36:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:36:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:36:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103021594] [2023-12-02 14:36:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:36:00,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:36:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:36:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:36:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:36:00,763 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:36:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:36:00,785 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-12-02 14:36:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:36:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-12-02 14:36:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:36:00,786 INFO L225 Difference]: With dead ends: 46 [2023-12-02 14:36:00,786 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 14:36:00,786 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 14:36:00,787 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:36:00,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:36:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 14:36:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-02 14:36:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:36:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-12-02 14:36:00,792 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 34 [2023-12-02 14:36:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:36:00,792 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-12-02 14:36:00,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:36:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-12-02 14:36:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 14:36:00,794 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:36:00,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:36:00,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 14:36:00,794 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:36:00,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:36:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1679656760, now seen corresponding path program 1 times [2023-12-02 14:36:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:36:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909748523] [2023-12-02 14:36:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:36:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:36:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:36:00,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:36:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909748523] [2023-12-02 14:36:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909748523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:36:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:36:00,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:36:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552368172] [2023-12-02 14:36:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:36:00,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:36:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:36:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:36:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:36:00,864 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:36:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:36:00,905 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-12-02 14:36:00,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:36:00,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-12-02 14:36:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:36:00,906 INFO L225 Difference]: With dead ends: 45 [2023-12-02 14:36:00,906 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 14:36:00,907 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 14:36:00,907 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:36:00,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:36:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 14:36:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-02 14:36:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:36:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-12-02 14:36:00,912 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2023-12-02 14:36:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:36:00,912 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-12-02 14:36:00,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:36:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-12-02 14:36:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 14:36:00,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:36:00,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:36:00,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 14:36:00,914 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:36:00,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:36:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1679752379, now seen corresponding path program 1 times [2023-12-02 14:36:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:36:00,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330213192] [2023-12-02 14:36:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:00,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:36:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:36:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:36:01,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:36:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330213192] [2023-12-02 14:36:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330213192] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:36:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153873990] [2023-12-02 14:36:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:36:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:36:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:36:01,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:36:01,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:36:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:36:01,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:36:01,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:36:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:36:01,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:36:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:36:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153873990] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:36:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359073858] [2023-12-02 14:36:01,286 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 14:36:01,286 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:36:01,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:36:01,287 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:36:01,287 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:36:02,375 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 14:36:02,421 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:36:22,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [359073858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:36:22,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:36:22,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [6, 6, 6] total 31 [2023-12-02 14:36:22,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729425221] [2023-12-02 14:36:22,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:36:22,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 14:36:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:36:22,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 14:36:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=769, Unknown=7, NotChecked=0, Total=930 [2023-12-02 14:36:22,782 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 23 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:36:26,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:28,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:31,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:33,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:35,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:38,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:42,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:44,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:47,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:49,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:51,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:53,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:56,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:36:58,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:00,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:02,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:05,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:07,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:09,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:12,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:14,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:16,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:18,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:20,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:23,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:25,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:27,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:29,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:31,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:34,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:36,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:38,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:40,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:42,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:44,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:46,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:37:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:37:47,226 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2023-12-02 14:37:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 14:37:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-12-02 14:37:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:37:47,227 INFO L225 Difference]: With dead ends: 67 [2023-12-02 14:37:47,227 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 14:37:47,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=185, Invalid=998, Unknown=7, NotChecked=0, Total=1190 [2023-12-02 14:37:47,229 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 6 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:37:47,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 628 Invalid, 37 Unknown, 0 Unchecked, 83.5s Time] [2023-12-02 14:37:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 14:37:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2023-12-02 14:37:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:37:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-12-02 14:37:47,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 35 [2023-12-02 14:37:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:37:47,236 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-12-02 14:37:47,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:37:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-12-02 14:37:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 14:37:47,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:37:47,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:37:47,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 14:37:47,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 14:37:47,439 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:37:47,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:37:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash -839032902, now seen corresponding path program 1 times [2023-12-02 14:37:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:37:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130915141] [2023-12-02 14:37:47,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:37:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:37:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:37:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 14:37:47,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:37:47,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130915141] [2023-12-02 14:37:47,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130915141] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:37:47,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429865542] [2023-12-02 14:37:47,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:37:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:37:47,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:37:47,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:37:47,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 14:37:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:37:47,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:37:47,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:37:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 14:37:47,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:37:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 14:37:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429865542] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:37:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1676383087] [2023-12-02 14:37:47,815 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 14:37:47,815 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:37:47,815 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:37:47,816 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:37:47,816 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:37:48,945 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 14:37:48,969 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:38:09,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1676383087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:38:09,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:38:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [6, 6, 6] total 31 [2023-12-02 14:38:09,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662300602] [2023-12-02 14:38:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:38:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 14:38:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:38:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 14:38:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=768, Unknown=6, NotChecked=0, Total=930 [2023-12-02 14:38:09,782 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:38:13,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:15,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:18,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:20,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:22,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:27,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:29,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:32,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:34,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:36,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:38,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:43,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:45,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:47,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:50,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:52,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:54,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:57,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:38:59,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:01,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:03,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:06,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:08,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:10,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:12,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:14,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:39:15,070 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-12-02 14:39:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 14:39:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-02 14:39:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:39:15,072 INFO L225 Difference]: With dead ends: 55 [2023-12-02 14:39:15,072 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 14:39:15,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=187, Invalid=997, Unknown=6, NotChecked=0, Total=1190 [2023-12-02 14:39:15,073 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 5 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:39:15,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 73 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 550 Invalid, 27 Unknown, 0 Unchecked, 64.4s Time] [2023-12-02 14:39:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 14:39:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2023-12-02 14:39:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:39:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-02 14:39:15,082 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 38 [2023-12-02 14:39:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:39:15,083 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-02 14:39:15,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:39:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-02 14:39:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 14:39:15,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:39:15,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:39:15,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 14:39:15,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 14:39:15,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:39:15,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:39:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -237251851, now seen corresponding path program 1 times [2023-12-02 14:39:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:39:15,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005397263] [2023-12-02 14:39:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:39:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:39:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:39:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:39:15,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:39:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005397263] [2023-12-02 14:39:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005397263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:39:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924308581] [2023-12-02 14:39:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:39:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:39:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:39:15,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:39:15,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 14:39:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:39:15,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:39:15,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:39:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:39:15,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:39:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 14:39:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924308581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:39:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168602072] [2023-12-02 14:39:15,662 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 14:39:15,662 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:39:15,662 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:39:15,662 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:39:15,662 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:39:16,809 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 14:39:16,833 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:39:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1168602072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:39:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:39:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [6, 6, 6] total 33 [2023-12-02 14:39:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880481025] [2023-12-02 14:39:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:39:47,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 14:39:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:39:47,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 14:39:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=872, Unknown=10, NotChecked=0, Total=1056 [2023-12-02 14:39:47,827 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:39:51,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:53,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:56,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:39:59,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:04,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:06,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:08,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:10,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:13,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:15,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:17,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:19,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:22,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:24,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:26,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:28,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:30,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:32,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:35,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:37,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:39,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:41,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:44,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:46,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:48,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:50,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:53,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:40:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:40:53,860 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-12-02 14:40:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 14:40:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-02 14:40:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:40:53,862 INFO L225 Difference]: With dead ends: 64 [2023-12-02 14:40:53,862 INFO L226 Difference]: Without dead ends: 62 [2023-12-02 14:40:53,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=205, Invalid=1117, Unknown=10, NotChecked=0, Total=1332 [2023-12-02 14:40:53,864 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 7 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:40:53,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 58 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 638 Invalid, 29 Unknown, 0 Unchecked, 65.1s Time] [2023-12-02 14:40:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-02 14:40:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2023-12-02 14:40:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:40:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-12-02 14:40:53,879 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2023-12-02 14:40:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:40:53,880 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-12-02 14:40:53,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:40:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-12-02 14:40:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 14:40:53,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:40:53,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:40:53,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 14:40:54,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 14:40:54,082 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-12-02 14:40:54,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:40:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash 606659682, now seen corresponding path program 1 times [2023-12-02 14:40:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:40:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809208752] [2023-12-02 14:40:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:40:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:40:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:40:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 14:40:54,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:40:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809208752] [2023-12-02 14:40:54,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809208752] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:40:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382178050] [2023-12-02 14:40:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:40:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:40:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:40:54,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:40:54,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 14:40:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:40:54,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:40:54,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:40:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 14:40:54,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:40:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 14:40:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382178050] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:40:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949376961] [2023-12-02 14:40:54,475 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 14:40:54,475 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:40:54,475 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:40:54,475 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:40:54,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:40:55,844 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 14:40:55,868 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:41:09,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1949376961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:41:09,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:41:09,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [6, 6, 6] total 35 [2023-12-02 14:41:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643735259] [2023-12-02 14:41:09,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:41:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 14:41:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:41:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 14:41:09,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1012, Unknown=3, NotChecked=0, Total=1190 [2023-12-02 14:41:09,293 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:41:12,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:15,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:17,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:19,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:22,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:24,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:27,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:29,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:32,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:35,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:37,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:39,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:42,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:44,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:46,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 14:41:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:41:47,422 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-12-02 14:41:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 14:41:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-12-02 14:41:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:41:47,423 INFO L225 Difference]: With dead ends: 54 [2023-12-02 14:41:47,423 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 14:41:47,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=206, Invalid=1273, Unknown=3, NotChecked=0, Total=1482 [2023-12-02 14:41:47,424 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 10 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:41:47,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 37.2s Time] [2023-12-02 14:41:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 14:41:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 14:41:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:41:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 14:41:47,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2023-12-02 14:41:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:41:47,426 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 14:41:47,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:41:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 14:41:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 14:41:47,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-12-02 14:41:47,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-12-02 14:41:47,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-12-02 14:41:47,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-12-02 14:41:47,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-12-02 14:41:47,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-12-02 14:41:47,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-12-02 14:41:47,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-12-02 14:41:47,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-12-02 14:41:47,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-12-02 14:41:47,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-12-02 14:41:47,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-12-02 14:41:47,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-12-02 14:41:47,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-12-02 14:41:47,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-12-02 14:41:47,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-12-02 14:41:47,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-12-02 14:41:47,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-12-02 14:41:47,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 14:41:47,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 14:41:47,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 14:43:08,581 WARN L293 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 365 DAG size of output: 337 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 14:43:09,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,072 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2023-12-02 14:43:09,072 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 620 639) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3)) (.cse4 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3)) (.cse7 (<= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse8 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|)) (.cse9 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1)) (.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (<= 2 |ULTIMATE.start_sll_circular_update_at_#in~data#1|)) (.cse5 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (<= 2 |ULTIMATE.start_main_~new_data~0#1|)) (.cse14 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse15 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_sll_circular_update_at_~index#1|) .cse3 (= |ULTIMATE.start_main_~i~0#1| 1) (or .cse4 (and (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|) (= 3 |ULTIMATE.start_main_~new_data~0#1|) .cse5 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1))) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse5 .cse12 .cse13 .cse14 .cse15))) [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2023-12-02 14:43:09,073 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (or (and (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point L625(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point L625-1(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,074 INFO L899 garLoopResultBuilder]: For program point L625-5(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,075 INFO L899 garLoopResultBuilder]: For program point L625-6(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,075 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,078 INFO L895 garLoopResultBuilder]: At program point L625-7(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse27 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse28 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse38 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse12 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse17 (= 3 |ULTIMATE.start_main_~new_data~0#1|)) (.cse2 (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse5 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse4 (= 2 |ULTIMATE.start_main_~new_data~0#1|))) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_main_~i~0#1_65| Int)) (or (and .cse2 (= |v_ULTIMATE.start_main_~i~0#1_65| 0) .cse3 .cse4 (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int)) (let ((.cse6 (store |v_#memory_$Pointer$.offset_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0))) (.cse9 (store |v_#memory_$Pointer$.base_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse7 (select (select .cse9 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse8 (+ (select (select .cse6 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse5))) (= (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 (select (select |v_#memory_$Pointer$.offset_99| .cse7) .cse8))) |v_#memory_$Pointer$.offset_99|) (= |v_#memory_int_148| (store |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_148| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 (select (select |v_#memory_$Pointer$.base_99| .cse7) .cse8))) |v_#memory_$Pointer$.base_99|) (= (store |v_#memory_$Pointer$.base_99| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_99| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse10)) |#memory_$Pointer$.base|) (= |#memory_int| (let ((.cse11 (store |v_#memory_int_148| .cse7 (store (select |v_#memory_int_148| .cse7) .cse8 3)))) (store .cse11 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~s~0#1.base|) 4 2))))))))) (and .cse12 (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int)) (let ((.cse13 (store |v_#memory_$Pointer$.offset_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0))) (.cse16 (store |v_#memory_$Pointer$.base_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_97| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse14 (select (select .cse16 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse15 (+ (select (select .cse13 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= |v_#memory_int_148| (store |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_148| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= |#memory_$Pointer$.offset| (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 (select (select |#memory_$Pointer$.offset| .cse14) .cse15)))) (= (store .cse16 .cse14 (store (select .cse16 .cse14) .cse15 (select (select |#memory_$Pointer$.base| .cse14) .cse15))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_148| .cse14 (store (select |v_#memory_int_148| .cse14) .cse15 3))))))) (= |v_ULTIMATE.start_main_~i~0#1_65| 1) .cse17 .cse3))) (exists ((|v_ULTIMATE.start_main_~i~0#1_84| Int)) (or (and .cse2 (= |v_ULTIMATE.start_main_~i~0#1_84| 0) (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| Int) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int)))) (let ((.cse18 (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 0))) (.cse21 (store |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse19 (select (select .cse21 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse20 (+ (select (select .cse18 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 (select (select |v_#memory_$Pointer$.offset_139| .cse19) .cse20))) |v_#memory_$Pointer$.offset_139|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_139| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse5))) (= (store .cse21 .cse19 (store (select .cse21 .cse19) .cse20 (select (select |v_#memory_$Pointer$.base_139| .cse19) .cse20))) |v_#memory_$Pointer$.base_139|) (= |v_#memory_int_196| (store |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 (select (select |v_#memory_int_196| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0)))) (= (store |v_#memory_$Pointer$.base_139| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse10)) |#memory_$Pointer$.base|) (= |#memory_int| (let ((.cse22 (store |v_#memory_int_196| .cse19 (store (select |v_#memory_int_196| .cse19) .cse20 3)))) (store .cse22 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse22 |ULTIMATE.start_main_~s~0#1.base|) 4 2)))))))) .cse3 .cse4) (and .cse12 .cse17 .cse3 (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| Int) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int)))) (let ((.cse25 (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 0))) (.cse26 (store |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse23 (select (select .cse26 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse24 (+ (select (select .cse25 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= |#memory_int| (store |v_#memory_int_196| .cse23 (store (select |v_#memory_int_196| .cse23) .cse24 3))) (= |#memory_$Pointer$.offset| (store .cse25 .cse23 (store (select .cse25 .cse23) .cse24 (select (select |#memory_$Pointer$.offset| .cse23) .cse24)))) (= |v_#memory_int_196| (store |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 (select (select |v_#memory_int_196| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0)))) (= |#memory_$Pointer$.base| (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 (select (select |#memory_$Pointer$.base| .cse23) .cse24)))))))) (= |v_ULTIMATE.start_main_~i~0#1_84| 1)))) .cse27 .cse28 (exists ((|v_ULTIMATE.start_main_~i~0#1_56| Int)) (or (and (= |v_ULTIMATE.start_main_~i~0#1_56| 0) .cse2 .cse3 .cse4 (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (let ((.cse29 (store |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0))) (.cse33 (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse30 (select (select .cse33 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse31 (+ (select (select .cse29 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= (store .cse29 .cse30 (store (select .cse29 .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_79| .cse30) .cse31))) |v_#memory_$Pointer$.offset_79|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_79| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_79| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse10))) (= (store |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_124| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_124|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse5))) (= |#memory_int| (let ((.cse32 (store |v_#memory_int_124| .cse30 (store (select |v_#memory_int_124| .cse30) .cse31 3)))) (store .cse32 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse32 |ULTIMATE.start_main_~s~0#1.base|) 4 2)))) (= (store .cse33 .cse30 (store (select .cse33 .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_79| .cse30) .cse31))) |v_#memory_$Pointer$.base_79|)))))) (and (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (let ((.cse36 (store |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0))) (.cse37 (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse34 (select (select .cse37 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse35 (+ (select (select .cse36 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_124| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_124|) (= (store |v_#memory_int_124| .cse34 (store (select |v_#memory_int_124| .cse34) .cse35 3)) |#memory_int|) (= |#memory_$Pointer$.offset| (store .cse36 .cse34 (store (select .cse36 .cse34) .cse35 (select (select |#memory_$Pointer$.offset| .cse34) .cse35)))) (= |#memory_$Pointer$.base| (store .cse37 .cse34 (store (select .cse37 .cse34) .cse35 (select (select |#memory_$Pointer$.base| .cse34) .cse35)))))))) .cse12 .cse17 (= |v_ULTIMATE.start_main_~i~0#1_56| 1) .cse3))) .cse38 (exists ((|v_ULTIMATE.start_main_~i~0#1_74| Int)) (or (and .cse12 (= |v_ULTIMATE.start_main_~i~0#1_74| 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| Int) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse42 (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0 0))) (.cse39 (store |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| (store (select |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse40 (select (select .cse39 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse41 (+ (select (select .cse42 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 (select (select |#memory_$Pointer$.base| .cse40) .cse41))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_171| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| (store (select |v_#memory_int_171| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0 (select (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0))) |v_#memory_int_172|) (= |#memory_int| (store |v_#memory_int_172| .cse40 (store (select |v_#memory_int_172| .cse40) .cse41 3))) (= |#memory_$Pointer$.offset| (store .cse42 .cse40 (store (select .cse42 .cse40) .cse41 (select (select |#memory_$Pointer$.offset| .cse40) .cse41)))))))) .cse17 .cse3) (and (= |v_ULTIMATE.start_main_~i~0#1_74| 0) .cse2 (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| Int) (|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_int_171| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int)))) (let ((.cse47 (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0 0))) (.cse46 (store |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| (store (select |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse44 (select (select .cse46 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse45 (+ (select (select .cse47 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse5))) (= |#memory_int| (let ((.cse43 (store |v_#memory_int_172| .cse44 (store (select |v_#memory_int_172| .cse44) .cse45 3)))) (store .cse43 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse43 |ULTIMATE.start_main_~s~0#1.base|) 4 2)))) (= (store .cse46 .cse44 (store (select .cse46 .cse44) .cse45 (select (select |v_#memory_$Pointer$.base_119| .cse44) .cse45))) |v_#memory_$Pointer$.base_119|) (= (store |v_#memory_int_171| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22| (store (select |v_#memory_int_171| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0 (select (select |v_#memory_int_172| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22|) 0))) |v_#memory_int_172|) (= |v_#memory_$Pointer$.offset_119| (store .cse47 .cse44 (store (select .cse47 .cse44) .cse45 (select (select |v_#memory_$Pointer$.offset_119| .cse44) .cse45)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_119| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_119| |ULTIMATE.start_main_~s~0#1.base|) 4 .cse10))))))) .cse3 .cse4))))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse27 (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_int_123| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |#memory_int| (store |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_123| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0))))) .cse28 .cse3 .cse38))) [2023-12-02 14:43:09,079 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2023-12-02 14:43:09,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2023-12-02 14:43:09,080 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (select |#memory_int| 1))) (and .cse0 (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse1 .cse2 .cse3 (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) .cse4 (= (select |#valid| 0) 0) .cse5 (= (select |#valid| 2) 1) (= (select .cse8 0) 48) .cse6 (= 27 (select |#length| 2)) (= (select .cse8 1) 0) .cse7)))) [2023-12-02 14:43:09,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 14:43:09,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2023-12-02 14:43:09,080 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-12-02 14:43:09,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2023-12-02 14:43:09,080 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) [2023-12-02 14:43:09,080 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L899 garLoopResultBuilder]: For program point L629(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L899 garLoopResultBuilder]: For program point L629-1(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L899 garLoopResultBuilder]: For program point L629-5(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L899 garLoopResultBuilder]: For program point L629-6(line 629) no Hoare annotation was computed. [2023-12-02 14:43:09,081 INFO L895 garLoopResultBuilder]: At program point L629-7(lines 629 634) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (exists ((|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| Int) (|v_#memory_$Pointer$.offset_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_137| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int)))) (let ((.cse5 (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 0))) (.cse8 (store |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_$Pointer$.base_137| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (let ((.cse6 (select (select .cse8 |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse7 (+ (select (select .cse5 |ULTIMATE.start_main_~s~0#1.base|) 0) 4))) (and (= (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_139| .cse6) .cse7))) |v_#memory_$Pointer$.offset_139|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_139| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.offset_139| |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse4 4)))) (= (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_139| .cse6) .cse7))) |v_#memory_$Pointer$.base_139|) (= |v_#memory_int_196| (store |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24| (store (select |v_#memory_int_195| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0 (select (select |v_#memory_int_196| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24|) 0)))) (= (store |v_#memory_$Pointer$.base_139| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_$Pointer$.base_139| |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse3 4))) |#memory_$Pointer$.base|) (= |#memory_int| (let ((.cse9 (store |v_#memory_int_196| .cse6 (store (select |v_#memory_int_196| .cse6) .cse7 3)))) (store .cse9 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~s~0#1.base|) 4 2))))))))) (.cse2 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (exists ((|v_ULTIMATE.start_main_~i~0#1_88| Int)) (let ((.cse0 (= (select (select |#memory_int| (select .cse3 0)) (+ (select .cse4 0) 4)) 3))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (= |v_ULTIMATE.start_main_~i~0#1_88| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) .cse1 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 3) .cse2) (and .cse0 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2) (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse1 (= |v_ULTIMATE.start_main_~i~0#1_88| 0) .cse2)))) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-12-02 14:43:09,082 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 14:43:09,082 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2023-12-02 14:43:09,082 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 14:43:09,082 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 14:43:09,082 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (or (not (= |node_create_#in~data#1| 1)) (< |#StackHeapBarrier| 1) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2023-12-02 14:43:09,082 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-02 14:43:09,085 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:43:09,086 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 14:43:09,101 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,103 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_88 : int :: ((((((#memory_int[#memory_$Pointer$.base[~s~0!base][0]][#memory_$Pointer$.offset[~s~0!base][0] + 4] == 3 && ~i~0 == 0) && v_ULTIMATE.start_main_~i~0#1_88 == 1) && 3 == ~expected~0) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) && #res == 3) && #res!base == ~s~0!base) || ((((((#memory_int[#memory_$Pointer$.base[~s~0!base][0]][#memory_$Pointer$.offset[~s~0!base][0] + 4] == 3 && #res == 2) && ~i~0 + 1 == 0) && 2 == ~expected~0) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) && v_ULTIMATE.start_main_~i~0#1_88 == 0) && #res!base == ~s~0!base)) could not be translated [2023-12-02 14:43:09,104 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]]) could not be translated [2023-12-02 14:43:09,104 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,105 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 14:43:09,105 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 14:43:09,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 14:43:09,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 14:43:09,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 14:43:09,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 14:43:09,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 14:43:09,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,120 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_65 : int :: ((((~i~0 + 1 == 0 && v_ULTIMATE.start_main_~i~0#1_65 == 0) && #res!base == ~s~0!base) && 2 == ~new_data~0) && (exists v_#memory_$Pointer$.base_97 : [int,int]int, v_#memory_$Pointer$.offset_97 : [int,int]int, v_#memory_$Pointer$.base_99 : [int,int]int, v_#memory_$Pointer$.offset_99 : [int,int]int, v_#memory_int_147 : [int,int]int, v_#memory_int_148 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 : int :: ((((#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_99[~s~0!base := v_#memory_$Pointer$.offset_99[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]] && v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_99[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_99) && v_#memory_int_148 == v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := v_#memory_int_148[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0]]]) && v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_99[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_99) && v_#memory_$Pointer$.base_99[~s~0!base := v_#memory_$Pointer$.base_99[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) || ((((~i~0 == 0 && (exists v_#memory_$Pointer$.base_97 : [int,int]int, v_#memory_$Pointer$.offset_97 : [int,int]int, v_#memory_int_147 : [int,int]int, v_#memory_int_148 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 : int :: ((v_#memory_int_148 == v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := v_#memory_int_148[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]]) && v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := 3]])) && v_ULTIMATE.start_main_~i~0#1_65 == 1) && 3 == ~new_data~0) && #res!base == ~s~0!base)) could not be translated [2023-12-02 14:43:09,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_84 : int :: ((((~i~0 + 1 == 0 && v_ULTIMATE.start_main_~i~0#1_84 == 0) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) && #res!base == ~s~0!base) && 2 == ~new_data~0) || ((((~i~0 == 0 && 3 == ~new_data~0) && #res!base == ~s~0!base) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((#memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]]) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]])) && v_ULTIMATE.start_main_~i~0#1_84 == 1)) could not be translated [2023-12-02 14:43:09,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_56 : int :: ((((v_ULTIMATE.start_main_~i~0#1_56 == 0 && ~i~0 + 1 == 0) && #res!base == ~s~0!base) && 2 == ~new_data~0) && (exists v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_$Pointer$.offset_79 : [int,int]int, v_#memory_int_123 : [int,int]int, v_#memory_int_124 : [int,int]int, v_#memory_$Pointer$.base_79 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((((v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_79[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_79 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_79[~s~0!base := v_#memory_$Pointer$.base_79[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]]) && v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_124[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_124) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_79[~s~0!base := v_#memory_$Pointer$.offset_79[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && #memory_int == v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]]) && v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_79[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_79)) || (((((exists v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_int_123 : [int,int]int, v_#memory_int_124 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_124[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_124 && v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := 3]] == #memory_int) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]]) && ~i~0 == 0) && 3 == ~new_data~0) && v_ULTIMATE.start_main_~i~0#1_56 == 1) && #res!base == ~s~0!base)) could not be translated [2023-12-02 14:43:09,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_74 : int :: ((((~i~0 == 0 && v_ULTIMATE.start_main_~i~0#1_74 == 1) && (exists v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 : int, v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_int_171 : [int,int]int, v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_int_172 : [int,int]int :: ((v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]] == #memory_$Pointer$.base && v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := v_#memory_int_172[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0]]] == v_#memory_int_172) && #memory_int == v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := 3]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]])) && 3 == ~new_data~0) && #res!base == ~s~0!base) || ((((v_ULTIMATE.start_main_~i~0#1_74 == 0 && ~i~0 + 1 == 0) && (exists v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 : int, v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_int_171 : [int,int]int, v_#memory_$Pointer$.offset_119 : [int,int]int, v_#memory_$Pointer$.base_119 : [int,int]int, v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_int_172 : [int,int]int :: ((((#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_119[~s~0!base := v_#memory_$Pointer$.offset_119[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]] && #memory_int == v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]]) && v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_119[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_119) && v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := v_#memory_int_172[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0]]] == v_#memory_int_172) && v_#memory_$Pointer$.offset_119 == v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_119[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_119[~s~0!base := v_#memory_$Pointer$.base_119[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]])) && #res!base == ~s~0!base) && 2 == ~new_data~0)) could not be translated [2023-12-02 14:43:09,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_int_123 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]] && #memory_int == v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]]) could not be translated [2023-12-02 14:43:09,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,124 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,124 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:43:09,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:43:09,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:43:09,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:43:09,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:43:09,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,126 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:43:09,127 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,127 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,127 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:43:09,127 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:43:09,128 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 14:43:09,128 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,129 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,129 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 14:43:09,129 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:43:09,129 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 14:43:09,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 14:43:09,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 14:43:09,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:43:09,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 14:43:09,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 14:43:09,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 14:43:09,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:43:09 BoogieIcfgContainer [2023-12-02 14:43:09,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 14:43:09,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 14:43:09,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 14:43:09,132 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 14:43:09,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:35:53" (3/4) ... [2023-12-02 14:43:09,134 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 14:43:09,138 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 14:43:09,144 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2023-12-02 14:43:09,145 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-12-02 14:43:09,145 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 14:43:09,146 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 14:43:09,170 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (len == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) [2023-12-02 14:43:09,171 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\old(data) <= 3) && (0 <= index)) && (index <= 1)) && (data <= 3)) && (2 <= data)) && (0 <= \old(index))) && (\old(index) <= 1)) && (data == 1)) && (2 <= \old(data))) || ((((((((\old(data) <= 3) && (data <= 3)) && (2 <= data)) && (0 <= \old(index))) && (\old(index) <= 1)) && (data == 1)) && (2 <= \old(data))) && (index == 0))) [2023-12-02 14:43:09,172 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= index) && (\old(index) <= 1)) && (0 <= \old(index))) && (index <= 1)) && ((\old(index) == 1) || (index == 0))) [2023-12-02 14:43:09,191 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (len == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) [2023-12-02 14:43:09,194 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\old(data) <= 3) && (0 <= index)) && (index <= 1)) && (data <= 3)) && (2 <= data)) && (0 <= \old(index))) && (\old(index) <= 1)) && (data == 1)) && (2 <= \old(data))) || ((((((((\old(data) <= 3) && (data <= 3)) && (2 <= data)) && (0 <= \old(index))) && (\old(index) <= 1)) && (data == 1)) && (2 <= \old(data))) && (index == 0))) [2023-12-02 14:43:09,194 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= index) && (\old(index) <= 1)) && (0 <= \old(index))) && (index <= 1)) && ((\old(index) == 1) || (index == 0))) [2023-12-02 14:43:09,239 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 14:43:09,239 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 14:43:09,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 14:43:09,240 INFO L158 Benchmark]: Toolchain (without parser) took 436520.82ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 111.3MB in the beginning and 178.2MB in the end (delta: -66.9MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,240 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory was 65.0MB in the beginning and 64.9MB in the end (delta: 53.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:43:09,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.56ms. Allocated memory is still 153.1MB. Free memory was 111.3MB in the beginning and 93.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.83ms. Allocated memory is still 153.1MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,241 INFO L158 Benchmark]: Boogie Preprocessor took 36.89ms. Allocated memory is still 153.1MB. Free memory was 91.1MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,241 INFO L158 Benchmark]: RCFGBuilder took 524.66ms. Allocated memory is still 153.1MB. Free memory was 88.9MB in the beginning and 67.3MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,242 INFO L158 Benchmark]: TraceAbstraction took 435389.84ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 66.6MB in the beginning and 184.5MB in the end (delta: -117.9MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,242 INFO L158 Benchmark]: Witness Printer took 107.45ms. Allocated memory is still 323.0MB. Free memory was 184.5MB in the beginning and 178.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 14:43:09,244 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.28ms. Allocated memory is still 113.2MB. Free memory was 65.0MB in the beginning and 64.9MB in the end (delta: 53.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.56ms. Allocated memory is still 153.1MB. Free memory was 111.3MB in the beginning and 93.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.83ms. Allocated memory is still 153.1MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.89ms. Allocated memory is still 153.1MB. Free memory was 91.1MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.66ms. Allocated memory is still 153.1MB. Free memory was 88.9MB in the beginning and 67.3MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 435389.84ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 66.6MB in the beginning and 184.5MB in the end (delta: -117.9MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. * Witness Printer took 107.45ms. Allocated memory is still 323.0MB. Free memory was 184.5MB in the beginning and 178.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_88 : int :: ((((((#memory_int[#memory_$Pointer$.base[~s~0!base][0]][#memory_$Pointer$.offset[~s~0!base][0] + 4] == 3 && ~i~0 == 0) && v_ULTIMATE.start_main_~i~0#1_88 == 1) && 3 == ~expected~0) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) && #res == 3) && #res!base == ~s~0!base) || ((((((#memory_int[#memory_$Pointer$.base[~s~0!base][0]][#memory_$Pointer$.offset[~s~0!base][0] + 4] == 3 && #res == 2) && ~i~0 + 1 == 0) && 2 == ~expected~0) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) && v_ULTIMATE.start_main_~i~0#1_88 == 0) && #res!base == ~s~0!base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] 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_ULTIMATE.start_main_~i~0#1_65 : int :: ((((~i~0 + 1 == 0 && v_ULTIMATE.start_main_~i~0#1_65 == 0) && #res!base == ~s~0!base) && 2 == ~new_data~0) && (exists v_#memory_$Pointer$.base_97 : [int,int]int, v_#memory_$Pointer$.offset_97 : [int,int]int, v_#memory_$Pointer$.base_99 : [int,int]int, v_#memory_$Pointer$.offset_99 : [int,int]int, v_#memory_int_147 : [int,int]int, v_#memory_int_148 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 : int :: ((((#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_99[~s~0!base := v_#memory_$Pointer$.offset_99[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]] && v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_99[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_99) && v_#memory_int_148 == v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := v_#memory_int_148[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0]]]) && v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_99[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_99) && v_#memory_$Pointer$.base_99[~s~0!base := v_#memory_$Pointer$.base_99[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) || ((((~i~0 == 0 && (exists v_#memory_$Pointer$.base_97 : [int,int]int, v_#memory_$Pointer$.offset_97 : [int,int]int, v_#memory_int_147 : [int,int]int, v_#memory_int_148 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 : int :: ((v_#memory_int_148 == v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_int_147[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := v_#memory_int_148[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0]]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]]) && v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0] := v_#memory_int_148[v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.base_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20 := v_#memory_$Pointer$.offset_97[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20][0 := 0]][~s~0!base][0] + 4 := 3]])) && v_ULTIMATE.start_main_~i~0#1_65 == 1) && 3 == ~new_data~0) && #res!base == ~s~0!base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_84 : int :: ((((~i~0 + 1 == 0 && v_ULTIMATE.start_main_~i~0#1_84 == 0) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.offset_139 : [int,int]int, v_#memory_$Pointer$.base_139 : [int,int]int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((((v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_139 && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_139[~s~0!base := v_#memory_$Pointer$.offset_139[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_139[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_139) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && v_#memory_$Pointer$.base_139[~s~0!base := v_#memory_$Pointer$.base_139[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]])) && #res!base == ~s~0!base) && 2 == ~new_data~0) || ((((~i~0 == 0 && 3 == ~new_data~0) && #res!base == ~s~0!base) && (exists v_#memory_$Pointer$.offset_137 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 : int, v_#memory_$Pointer$.base_137 : [int,int]int, v_#memory_int_195 : [int,int]int, v_#memory_int_196 : [int,int]int :: ((#memory_int == v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_int_196[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := 3]] && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]]) && v_#memory_int_196 == v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_int_195[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := v_#memory_int_196[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0]]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.base_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24 := v_#memory_$Pointer$.offset_137[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_24][0 := 0]][~s~0!base][0] + 4]]])) && v_ULTIMATE.start_main_~i~0#1_84 == 1)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_56 : int :: ((((v_ULTIMATE.start_main_~i~0#1_56 == 0 && ~i~0 + 1 == 0) && #res!base == ~s~0!base) && 2 == ~new_data~0) && (exists v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_$Pointer$.offset_79 : [int,int]int, v_#memory_int_123 : [int,int]int, v_#memory_int_124 : [int,int]int, v_#memory_$Pointer$.base_79 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((((v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_79[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.offset_79 && #memory_$Pointer$.base == v_#memory_$Pointer$.base_79[~s~0!base := v_#memory_$Pointer$.base_79[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]]) && v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_124[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_124) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_79[~s~0!base := v_#memory_$Pointer$.offset_79[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && #memory_int == v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]]) && v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_79[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_79)) || (((((exists v_#memory_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_int_123 : [int,int]int, v_#memory_int_124 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_124[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_124 && v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_int_124[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := 3]] == #memory_int) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][0] + 4]]]) && ~i~0 == 0) && 3 == ~new_data~0) && v_ULTIMATE.start_main_~i~0#1_56 == 1) && #res!base == ~s~0!base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_74 : int :: ((((~i~0 == 0 && v_ULTIMATE.start_main_~i~0#1_74 == 1) && (exists v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 : int, v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_int_171 : [int,int]int, v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_int_172 : [int,int]int :: ((v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]] == #memory_$Pointer$.base && v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := v_#memory_int_172[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0]]] == v_#memory_int_172) && #memory_int == v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := 3]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]])) && 3 == ~new_data~0) && #res!base == ~s~0!base) || ((((v_ULTIMATE.start_main_~i~0#1_74 == 0 && ~i~0 + 1 == 0) && (exists v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 : int, v_#memory_$Pointer$.offset_117 : [int,int]int, v_#memory_int_171 : [int,int]int, v_#memory_$Pointer$.offset_119 : [int,int]int, v_#memory_$Pointer$.base_119 : [int,int]int, v_#memory_$Pointer$.base_117 : [int,int]int, v_#memory_int_172 : [int,int]int :: ((((#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_119[~s~0!base := v_#memory_$Pointer$.offset_119[~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]] && #memory_int == v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_int_172[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := 3]][~s~0!base][4 := 2]]) && v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.base_119[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]] == v_#memory_$Pointer$.base_119) && v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_int_171[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := v_#memory_int_172[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0]]] == v_#memory_int_172) && v_#memory_$Pointer$.offset_119 == v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0] := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4 := v_#memory_$Pointer$.offset_119[v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.base_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := #res!base]][~s~0!base][0]][v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22 := v_#memory_$Pointer$.offset_117[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_22][0 := 0]][~s~0!base][0] + 4]]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_119[~s~0!base := v_#memory_$Pointer$.base_119[~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]])) && #res!base == ~s~0!base) && 2 == ~new_data~0)) 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_$Pointer$.base_77 : [int,int]int, v_#memory_$Pointer$.offset_77 : [int,int]int, v_#memory_int_123 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: (#memory_$Pointer$.base == v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]] && #memory_int == v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_123[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base 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: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!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: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - 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: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!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: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~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!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - 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: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 435.3s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 254.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 81.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 109 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 250.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 236.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 829 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2984 IncrementalHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 458 mSDtfsCounter, 2984 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 453 SyntacticMatches, 26 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 91.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 95 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 26 NumberOfFragments, 4130 HoareAnnotationTreeSize, 11 FomulaSimplifications, 7840 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4852 FormulaSimplificationTreeSizeReductionInter, 81.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 1958 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1736 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 202/221 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: 4.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 157, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 353, TOOLS_POST_TIME: 2.1s, TOOLS_POST_CALL_APPLICATIONS: 40, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 32, TOOLS_POST_RETURN_TIME: 0.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 375, TOOLS_QUANTIFIERELIM_TIME: 3.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 652, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 83, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 43, DOMAIN_ISSUBSETEQ_TIME: 0.2s, DOMAIN_ISBOTTOM_APPLICATIONS: 157, DOMAIN_ISBOTTOM_TIME: 0.6s, LOOP_SUMMARIZER_APPLICATIONS: 31, LOOP_SUMMARIZER_CACHE_MISSES: 31, LOOP_SUMMARIZER_OVERALL_TIME: 2.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 43, CALL_SUMMARIZER_APPLICATIONS: 32, CALL_SUMMARIZER_CACHE_MISSES: 4, 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: 4662, DAG_COMPRESSION_RETAINED_NODES: 464, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((data == 1) && (len == 2)) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((((((\old(data) == 1) && (len == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((data == 1) && (len == 2)) || (((i == 1) && (data == 1)) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((((((((((\old(data) <= 3) && (0 <= index)) && (index <= 1)) && (data <= 3)) && (2 <= data)) && (0 <= \old(index))) && (\old(index) <= 1)) && (data == 1)) && (2 <= \old(data))) || ((((((((\old(data) <= 3) && (data <= 3)) && (2 <= data)) && (0 <= \old(index))) && (\old(index) <= 1)) && (data == 1)) && (2 <= \old(data))) && (index == 0))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((((0 <= index) && (\old(index) <= 1)) && (0 <= \old(index))) && (index <= 1)) && ((\old(index) == 1) || (index == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-02 14:43:09,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57354bc8-7082-4dde-8b41-c00450cd6a31/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