./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX --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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:54:14,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:54:15,059 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:54:15,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:54:15,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:54:15,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:54:15,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:54:15,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:54:15,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:54:15,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:54:15,100 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:54:15,101 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:54:15,101 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:54:15,102 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:54:15,102 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:54:15,103 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:54:15,104 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:54:15,104 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:54:15,104 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:54:15,105 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:54:15,106 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:54:15,106 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:54:15,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:54:15,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:54:15,108 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:54:15,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:54:15,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:54:15,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:54:15,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:54:15,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:54:15,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:54:15,111 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:54:15,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:54:15,111 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:54:15,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:54:15,112 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:54:15,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:54:15,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:54:15,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:54:15,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:54:15,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:54:15,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:54:15,114 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:54:15,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:54:15,114 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:54:15,114 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:54:15,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:54:15,115 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_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/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_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2023-11-12 00:54:15,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:54:15,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:54:15,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:54:15,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:54:15,434 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:54:15,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2023-11-12 00:54:18,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:54:18,872 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:54:18,873 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2023-11-12 00:54:18,890 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/data/6cf6cb331/8e2cf5fefee7434489f736564ed126db/FLAG98ace08ea [2023-11-12 00:54:18,905 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/data/6cf6cb331/8e2cf5fefee7434489f736564ed126db [2023-11-12 00:54:18,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:54:18,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:54:18,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:54:18,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:54:18,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:54:18,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:18" (1/1) ... [2023-11-12 00:54:18,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c98e006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:18, skipping insertion in model container [2023-11-12 00:54:18,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:18" (1/1) ... [2023-11-12 00:54:19,028 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:54:19,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:54:19,335 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:54:19,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:54:19,455 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:54:19,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19 WrapperNode [2023-11-12 00:54:19,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:54:19,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:54:19,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:54:19,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:54:19,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,513 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2023-11-12 00:54:19,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:54:19,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:54:19,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:54:19,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:54:19,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:54:19,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:54:19,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:54:19,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:54:19,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (1/1) ... [2023-11-12 00:54:19,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:54:19,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:19,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:54:19,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:54:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:54:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:54:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:54:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:54:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:54:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:54:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:54:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:54:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:54:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:54:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:54:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:54:19,784 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:54:19,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:54:20,074 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:54:20,153 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:54:20,153 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-12 00:54:20,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:20 BoogieIcfgContainer [2023-11-12 00:54:20,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:54:20,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:54:20,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:54:20,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:54:20,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:54:18" (1/3) ... [2023-11-12 00:54:20,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651664fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:20, skipping insertion in model container [2023-11-12 00:54:20,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:19" (2/3) ... [2023-11-12 00:54:20,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651664fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:20, skipping insertion in model container [2023-11-12 00:54:20,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:20" (3/3) ... [2023-11-12 00:54:20,173 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2023-11-12 00:54:20,197 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:54:20,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-12 00:54:20,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:54:20,271 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;@4c2c3567, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:54:20,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-12 00:54:20,276 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-11-12 00:54:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:54:20,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:20,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:20,285 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-11-12 00:54:20,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -543520604, now seen corresponding path program 1 times [2023-11-12 00:54:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756093889] [2023-11-12 00:54:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:20,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756093889] [2023-11-12 00:54:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756093889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:20,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:20,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699691136] [2023-11-12 00:54:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:20,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:54:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:54:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:20,873 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-11-12 00:54:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:21,001 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2023-11-12 00:54:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:54:21,004 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-11-12 00:54:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:21,013 INFO L225 Difference]: With dead ends: 105 [2023-11-12 00:54:21,013 INFO L226 Difference]: Without dead ends: 57 [2023-11-12 00:54:21,017 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-11-12 00:54:21,024 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:21,025 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.1s Time] [2023-11-12 00:54:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-12 00:54:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-11-12 00:54:21,076 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-11-12 00:54:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-12 00:54:21,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2023-11-12 00:54:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:21,080 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-12 00:54:21,080 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-11-12 00:54:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-12 00:54:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:54:21,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:21,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:21,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:54:21,082 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-11-12 00:54:21,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1475513770, now seen corresponding path program 1 times [2023-11-12 00:54:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101351128] [2023-11-12 00:54:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:21,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101351128] [2023-11-12 00:54:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101351128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315487657] [2023-11-12 00:54:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:21,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:54:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:21,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:54:21,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:54:21,227 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-11-12 00:54:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:21,304 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-11-12 00:54:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:54:21,305 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-11-12 00:54:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:21,306 INFO L225 Difference]: With dead ends: 57 [2023-11-12 00:54:21,306 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 00:54:21,307 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-11-12 00:54:21,309 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:21,309 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.1s Time] [2023-11-12 00:54:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 00:54:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-12 00:54:21,317 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-11-12 00:54:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2023-11-12 00:54:21,319 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 13 [2023-11-12 00:54:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:21,319 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2023-11-12 00:54:21,319 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-11-12 00:54:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2023-11-12 00:54:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:54:21,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:21,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:21,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:54:21,321 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-11-12 00:54:21,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1959491635, now seen corresponding path program 1 times [2023-11-12 00:54:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857867233] [2023-11-12 00:54:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:21,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:21,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857867233] [2023-11-12 00:54:21,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857867233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:21,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:21,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:54:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912930010] [2023-11-12 00:54:21,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:21,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:54:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:54:21,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:21,434 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-11-12 00:54:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:21,516 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-11-12 00:54:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:54:21,518 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-11-12 00:54:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:21,519 INFO L225 Difference]: With dead ends: 55 [2023-11-12 00:54:21,519 INFO L226 Difference]: Without dead ends: 51 [2023-11-12 00:54:21,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:21,521 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:21,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-12 00:54:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-12 00:54:21,531 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-11-12 00:54:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-11-12 00:54:21,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2023-11-12 00:54:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:21,538 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-11-12 00:54:21,538 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-11-12 00:54:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-11-12 00:54:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:54:21,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:21,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:21,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:54:21,540 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-11-12 00:54:21,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1980254743, now seen corresponding path program 1 times [2023-11-12 00:54:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:21,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51645685] [2023-11-12 00:54:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:21,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:21,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51645685] [2023-11-12 00:54:21,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51645685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:21,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:21,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:21,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834051737] [2023-11-12 00:54:21,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:21,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:54:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:21,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:54:21,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:54:21,695 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-11-12 00:54:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:21,785 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-11-12 00:54:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:54:21,786 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-11-12 00:54:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:21,791 INFO L225 Difference]: With dead ends: 69 [2023-11-12 00:54:21,791 INFO L226 Difference]: Without dead ends: 51 [2023-11-12 00:54:21,792 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-11-12 00:54:21,802 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:21,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-12 00:54:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-11-12 00:54:21,809 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-11-12 00:54:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2023-11-12 00:54:21,810 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 19 [2023-11-12 00:54:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:21,811 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2023-11-12 00:54:21,811 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-11-12 00:54:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2023-11-12 00:54:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:54:21,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:21,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:21,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:54:21,815 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-11-12 00:54:21,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1258354967, now seen corresponding path program 1 times [2023-11-12 00:54:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:21,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440323293] [2023-11-12 00:54:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:21,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440323293] [2023-11-12 00:54:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440323293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993763866] [2023-11-12 00:54:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:22,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:54:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:54:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:54:22,003 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-11-12 00:54:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:22,098 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2023-11-12 00:54:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:54:22,098 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-11-12 00:54:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:22,101 INFO L225 Difference]: With dead ends: 76 [2023-11-12 00:54:22,101 INFO L226 Difference]: Without dead ends: 74 [2023-11-12 00:54:22,102 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-11-12 00:54:22,106 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:22,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-12 00:54:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2023-11-12 00:54:22,124 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-11-12 00:54:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2023-11-12 00:54:22,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 20 [2023-11-12 00:54:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:22,129 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2023-11-12 00:54:22,130 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-11-12 00:54:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2023-11-12 00:54:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:54:22,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:22,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:54:22,132 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-11-12 00:54:22,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1840685089, now seen corresponding path program 1 times [2023-11-12 00:54:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473737994] [2023-11-12 00:54:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:54:22,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473737994] [2023-11-12 00:54:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473737994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367972485] [2023-11-12 00:54:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:22,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:22,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:22,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:22,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:54:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:22,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:54:22,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:22,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:54:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367972485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:22,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:54:22,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-12 00:54:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163527073] [2023-11-12 00:54:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:22,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:22,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:22,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:54:22,594 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-11-12 00:54:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:22,666 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2023-11-12 00:54:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:22,667 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-11-12 00:54:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:22,669 INFO L225 Difference]: With dead ends: 96 [2023-11-12 00:54:22,669 INFO L226 Difference]: Without dead ends: 49 [2023-11-12 00:54:22,670 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-11-12 00:54:22,672 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-11-12 00:54:22,673 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-11-12 00:54:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-12 00:54:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-12 00:54:22,685 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-11-12 00:54:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-12 00:54:22,686 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2023-11-12 00:54:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:22,687 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-12 00:54:22,688 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-11-12 00:54:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-12 00:54:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:54:22,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:22,689 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-11-12 00:54:22,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:22,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:54:22,899 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-11-12 00:54:22,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1901651399, now seen corresponding path program 1 times [2023-11-12 00:54:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530344591] [2023-11-12 00:54:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:23,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530344591] [2023-11-12 00:54:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530344591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:54:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720651396] [2023-11-12 00:54:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:23,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:54:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:54:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:23,042 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-11-12 00:54:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:23,089 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-11-12 00:54:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:54:23,090 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-11-12 00:54:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:23,092 INFO L225 Difference]: With dead ends: 49 [2023-11-12 00:54:23,092 INFO L226 Difference]: Without dead ends: 48 [2023-11-12 00:54:23,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:23,093 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:23,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:54:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-12 00:54:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-12 00:54:23,103 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-11-12 00:54:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-11-12 00:54:23,104 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2023-11-12 00:54:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:23,105 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-11-12 00:54:23,105 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-11-12 00:54:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-11-12 00:54:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:54:23,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:23,106 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-11-12 00:54:23,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:54:23,107 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-11-12 00:54:23,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1901647388, now seen corresponding path program 1 times [2023-11-12 00:54:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:23,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903886611] [2023-11-12 00:54:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:23,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903886611] [2023-11-12 00:54:23,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903886611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14751042] [2023-11-12 00:54:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:23,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:54:23,284 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-11-12 00:54:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:23,413 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2023-11-12 00:54:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-11-12 00:54:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:23,415 INFO L225 Difference]: With dead ends: 101 [2023-11-12 00:54:23,415 INFO L226 Difference]: Without dead ends: 70 [2023-11-12 00:54:23,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:23,418 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 59 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:23,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 72 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-12 00:54:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2023-11-12 00:54:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.3243243243243243) 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-11-12 00:54:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-12 00:54:23,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2023-11-12 00:54:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:23,427 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-12 00:54:23,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-11-12 00:54:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-12 00:54:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:54:23,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:23,429 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-11-12 00:54:23,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:54:23,430 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-11-12 00:54:23,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1178348866, now seen corresponding path program 1 times [2023-11-12 00:54:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:23,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508488313] [2023-11-12 00:54:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:23,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:23,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508488313] [2023-11-12 00:54:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508488313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:23,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124552469] [2023-11-12 00:54:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:23,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:54:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:54:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:23,639 INFO L87 Difference]: Start difference. First operand 49 states and 53 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-11-12 00:54:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:23,768 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-11-12 00:54:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:23,768 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-11-12 00:54:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:23,769 INFO L225 Difference]: With dead ends: 67 [2023-11-12 00:54:23,769 INFO L226 Difference]: Without dead ends: 66 [2023-11-12 00:54:23,770 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-11-12 00:54:23,770 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 79 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:23,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 91 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-12 00:54:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2023-11-12 00:54:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-11-12 00:54:23,778 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2023-11-12 00:54:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:23,778 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-11-12 00:54:23,778 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-11-12 00:54:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-11-12 00:54:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:54:23,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:23,779 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] [2023-11-12 00:54:23,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:54:23,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:23,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1478099121, now seen corresponding path program 1 times [2023-11-12 00:54:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736143070] [2023-11-12 00:54:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:23,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736143070] [2023-11-12 00:54:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736143070] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830131821] [2023-11-12 00:54:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:23,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:23,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:23,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:54:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:24,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:54:24,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:24,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:54:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830131821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:24,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:54:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-12 00:54:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547047857] [2023-11-12 00:54:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:24,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:24,142 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-11-12 00:54:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:24,258 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-11-12 00:54:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:54:24,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2023-11-12 00:54:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:24,260 INFO L225 Difference]: With dead ends: 66 [2023-11-12 00:54:24,260 INFO L226 Difference]: Without dead ends: 65 [2023-11-12 00:54:24,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:24,261 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 74 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:24,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 72 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-12 00:54:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2023-11-12 00:54:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-11-12 00:54:24,269 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2023-11-12 00:54:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:24,270 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-11-12 00:54:24,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-11-12 00:54:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-11-12 00:54:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:54:24,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:24,271 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] [2023-11-12 00:54:24,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:24,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:54:24,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:24,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:24,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1423567608, now seen corresponding path program 1 times [2023-11-12 00:54:24,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680279423] [2023-11-12 00:54:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:24,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680279423] [2023-11-12 00:54:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680279423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415644905] [2023-11-12 00:54:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:24,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:24,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:24,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:54:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:24,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:54:24,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:24,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:54:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415644905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:54:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-12 00:54:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117332277] [2023-11-12 00:54:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:24,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:54:24,994 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11-12 00:54:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:25,085 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-12 00:54:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:25,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 26 [2023-11-12 00:54:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:25,087 INFO L225 Difference]: With dead ends: 63 [2023-11-12 00:54:25,087 INFO L226 Difference]: Without dead ends: 61 [2023-11-12 00:54:25,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:54:25,088 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:25,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 64 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-12 00:54:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2023-11-12 00:54:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2682926829268293) 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-11-12 00:54:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-12 00:54:25,095 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2023-11-12 00:54:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:25,095 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-12 00:54:25,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11-12 00:54:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-12 00:54:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-12 00:54:25,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:25,097 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 00:54:25,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:25,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:54:25,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:25,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1003436319, now seen corresponding path program 1 times [2023-11-12 00:54:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:25,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364529700] [2023-11-12 00:54:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:54:25,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364529700] [2023-11-12 00:54:25,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364529700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:25,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:25,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:54:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510351863] [2023-11-12 00:54:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:25,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:25,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:25,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:54:25,441 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-11-12 00:54:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:25,519 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-11-12 00:54:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 31 [2023-11-12 00:54:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:25,520 INFO L225 Difference]: With dead ends: 57 [2023-11-12 00:54:25,520 INFO L226 Difference]: Without dead ends: 56 [2023-11-12 00:54:25,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:25,521 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:25,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-12 00:54:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-11-12 00:54:25,527 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-11-12 00:54:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-12 00:54:25,528 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 31 [2023-11-12 00:54:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:25,528 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-12 00:54:25,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-11-12 00:54:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-12 00:54:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-12 00:54:25,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:25,529 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-11-12 00:54:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:54:25,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:25,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1041879067, now seen corresponding path program 1 times [2023-11-12 00:54:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400306657] [2023-11-12 00:54:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:25,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400306657] [2023-11-12 00:54:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400306657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355562287] [2023-11-12 00:54:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:25,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:25,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:25,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:25,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:54:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:26,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:54:26,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:26,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355562287] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:54:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1631805131] [2023-11-12 00:54:26,213 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:54:26,214 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:26,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:26,224 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:26,224 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:29,196 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:54:29,207 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1631805131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 7, 7] total 27 [2023-11-12 00:54:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045117157] [2023-11-12 00:54:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:31,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:54:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:54:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=576, Unknown=1, NotChecked=0, Total=702 [2023-11-12 00:54:31,261 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:32,119 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-11-12 00:54:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 00:54:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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 32 [2023-11-12 00:54:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:32,122 INFO L225 Difference]: With dead ends: 59 [2023-11-12 00:54:32,122 INFO L226 Difference]: Without dead ends: 58 [2023-11-12 00:54:32,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=576, Unknown=1, NotChecked=0, Total=702 [2023-11-12 00:54:32,123 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:32,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 103 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 4 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 00:54:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-12 00:54:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2023-11-12 00:54:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) 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-11-12 00:54:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-11-12 00:54:32,132 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2023-11-12 00:54:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:32,132 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-11-12 00:54:32,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-11-12 00:54:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 00:54:32,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:32,134 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-11-12 00:54:32,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-12 00:54:32,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:32,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:32,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1660452082, now seen corresponding path program 1 times [2023-11-12 00:54:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:32,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520801765] [2023-11-12 00:54:32,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:32,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:54:32,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520801765] [2023-11-12 00:54:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520801765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:32,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:54:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648563471] [2023-11-12 00:54:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:32,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:54:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:54:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:32,422 INFO L87 Difference]: Start difference. First operand 45 states and 49 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-11-12 00:54:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:32,464 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-11-12 00:54:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:54:32,465 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-11-12 00:54:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:32,466 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:54:32,466 INFO L226 Difference]: Without dead ends: 44 [2023-11-12 00:54:32,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:32,467 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:32,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:54:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-12 00:54:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-12 00:54:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) 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-11-12 00:54:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-11-12 00:54:32,475 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2023-11-12 00:54:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:32,476 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-11-12 00:54:32,476 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-11-12 00:54:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-11-12 00:54:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 00:54:32,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:32,480 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-11-12 00:54:32,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:54:32,481 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:32,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash -65499301, now seen corresponding path program 1 times [2023-11-12 00:54:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068041484] [2023-11-12 00:54:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:54:32,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:32,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068041484] [2023-11-12 00:54:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068041484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:32,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364177009] [2023-11-12 00:54:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:32,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:54:32,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:32,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:54:32,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:54:32,584 INFO L87 Difference]: Start difference. First operand 44 states and 48 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-11-12 00:54:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:32,647 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-11-12 00:54:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:54:32,647 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-11-12 00:54:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:32,648 INFO L225 Difference]: With dead ends: 44 [2023-11-12 00:54:32,648 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 00:54:32,649 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-11-12 00:54:32,649 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:32,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:54:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 00:54:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-12 00:54:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-12 00:54:32,657 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2023-11-12 00:54:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:32,658 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-12 00:54:32,658 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-11-12 00:54:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-12 00:54:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 00:54:32,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:32,659 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-11-12 00:54:32,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 00:54:32,660 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-11-12 00:54:32,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -65592874, now seen corresponding path program 1 times [2023-11-12 00:54:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972570302] [2023-11-12 00:54:32,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:54:32,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:32,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972570302] [2023-11-12 00:54:32,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972570302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:32,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822587250] [2023-11-12 00:54:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:32,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:32,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:32,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:54:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:33,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:54:33,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:33,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822587250] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:54:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955509920] [2023-11-12 00:54:33,146 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-11-12 00:54:33,146 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:33,146 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:33,147 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:33,147 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:39,106 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:54:39,116 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [955509920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [6, 6, 6] total 26 [2023-11-12 00:54:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268130260] [2023-11-12 00:54:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:42,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:54:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:54:42,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=550, Unknown=2, NotChecked=0, Total=650 [2023-11-12 00:54:42,123 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-11-12 00:54:45,507 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-11-12 00:54:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:46,019 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-11-12 00:54:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-12 00:54:46,020 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-11-12 00:54:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:46,020 INFO L225 Difference]: With dead ends: 75 [2023-11-12 00:54:46,020 INFO L226 Difference]: Without dead ends: 58 [2023-11-12 00:54:46,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=126, Invalid=684, Unknown=2, NotChecked=0, Total=812 [2023-11-12 00:54:46,022 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:46,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 64 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 543 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2023-11-12 00:54:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-12 00:54:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2023-11-12 00:54:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1590909090909092) 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-11-12 00:54:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-11-12 00:54:46,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 35 [2023-11-12 00:54:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:46,037 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-11-12 00:54:46,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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-11-12 00:54:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-11-12 00:54:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-12 00:54:46,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:46,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2023-11-12 00:54:46,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:46,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:46,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:46,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash -333833122, now seen corresponding path program 1 times [2023-11-12 00:54:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:46,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796309370] [2023-11-12 00:54:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:54:46,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796309370] [2023-11-12 00:54:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796309370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:46,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:46,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:54:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108084280] [2023-11-12 00:54:46,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:54:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:54:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:54:46,409 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-11-12 00:54:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:46,579 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-11-12 00:54:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:54:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 44 [2023-11-12 00:54:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:46,581 INFO L225 Difference]: With dead ends: 72 [2023-11-12 00:54:46,581 INFO L226 Difference]: Without dead ends: 60 [2023-11-12 00:54:46,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:54:46,582 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:46,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 92 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-12 00:54:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2023-11-12 00:54:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) 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-11-12 00:54:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-12 00:54:46,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 44 [2023-11-12 00:54:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:46,597 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-12 00:54:46,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-11-12 00:54:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-12 00:54:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-12 00:54:46,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:46,598 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-11-12 00:54:46,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 00:54:46,599 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:46,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1755991274, now seen corresponding path program 1 times [2023-11-12 00:54:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525235094] [2023-11-12 00:54:46,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:46,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:54:46,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525235094] [2023-11-12 00:54:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525235094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:46,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:46,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:54:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120641799] [2023-11-12 00:54:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:46,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:54:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:46,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:54:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:54:46,728 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-11-12 00:54:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:46,828 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2023-11-12 00:54:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:54:46,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 45 [2023-11-12 00:54:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:46,830 INFO L225 Difference]: With dead ends: 56 [2023-11-12 00:54:46,830 INFO L226 Difference]: Without dead ends: 54 [2023-11-12 00:54:46,830 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-11-12 00:54:46,831 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:46,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-12 00:54:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-11-12 00:54:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1111111111111112) 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-11-12 00:54:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-12 00:54:46,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 45 [2023-11-12 00:54:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:46,845 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-12 00:54:46,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-11-12 00:54:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-12 00:54:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-12 00:54:46,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:46,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2023-11-12 00:54:46,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 00:54:46,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-11-12 00:54:46,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1556103779, now seen corresponding path program 1 times [2023-11-12 00:54:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050661233] [2023-11-12 00:54:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:54:47,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050661233] [2023-11-12 00:54:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050661233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597862527] [2023-11-12 00:54:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:47,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:47,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:47,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:54:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:47,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:54:47,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:54:47,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:54:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597862527] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:54:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [595066682] [2023-11-12 00:54:47,536 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-11-12 00:54:47,536 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:47,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:47,537 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:47,537 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:53,529 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:54:53,539 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:57,369 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3727#(and (<= 2147483649 |ULTIMATE.start_dll_circular_get_data_at_#t~post10#1|) (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| |ULTIMATE.start_dll_circular_get_data_at_#t~post10#1|) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_35| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_35| Int)) (and (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_35|) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_35|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_35|) |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_35|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))))' at error location [2023-11-12 00:54:57,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:54:57,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:57,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-12 00:54:57,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966736444] [2023-11-12 00:54:57,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:57,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:54:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:54:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=976, Unknown=1, NotChecked=0, Total=1122 [2023-11-12 00:54:57,371 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-11-12 00:54:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:57,626 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-11-12 00:54:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:54:57,627 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 51 [2023-11-12 00:54:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:57,627 INFO L225 Difference]: With dead ends: 64 [2023-11-12 00:54:57,627 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:54:57,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=173, Invalid=1158, Unknown=1, NotChecked=0, Total=1332 [2023-11-12 00:54:57,629 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:57,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:54:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:54:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:54:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:54:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:54:57,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-11-12 00:54:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:57,631 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:54:57,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-11-12 00:54:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:54:57,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:54:57,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-11-12 00:54:57,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-11-12 00:54:57,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-11-12 00:54:57,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-11-12 00:54:57,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-11-12 00:54:57,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-11-12 00:54:57,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-11-12 00:54:57,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-11-12 00:54:57,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-11-12 00:54:57,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-11-12 00:54:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-11-12 00:54:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-11-12 00:54:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-11-12 00:54:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-11-12 00:54:57,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-11-12 00:54:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-11-12 00:54:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-11-12 00:54:57,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-11-12 00:54:57,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:57,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:57,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:55:07,085 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 139 DAG size of output: 106 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-12 00:55:10,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2023-11-12 00:55:10,373 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2023-11-12 00:55:10,374 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (exists ((|v_#memory_int_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_BEFORE_CALL_16| 1))) (and (= (select .cse0 0) 48) (= (select .cse0 1) 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) (exists ((|v_#valid_36| (Array Int Int))) (and (= (store |v_#valid_36| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|) (= (select |v_#valid_36| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#memory_int_233| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 8 1))) (= |v_#memory_int_48| (store |v_#memory_int_233| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_233| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse2 0)))) (= |v_#memory_int_47| (store |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 4 (select .cse1 4))))))) (= |ULTIMATE.start_dll_circular_create_~data#1| 1)) [2023-11-12 00:55:10,374 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2023-11-12 00:55:10,374 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-12 00:55:10,374 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-11-12 00:55:10,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-11-12 00:55:10,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2023-11-12 00:55:10,375 INFO L899 garLoopResultBuilder]: For program point L631(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,375 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,375 INFO L899 garLoopResultBuilder]: For program point L631-5(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,376 INFO L899 garLoopResultBuilder]: For program point L631-6(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,376 INFO L895 garLoopResultBuilder]: At program point L631-7(lines 631 634) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) [2023-11-12 00:55:10,376 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,376 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2023-11-12 00:55:10,376 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2023-11-12 00:55:10,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2023-11-12 00:55:10,377 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2023-11-12 00:55:10,377 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2023-11-12 00:55:10,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,377 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:55:10,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,378 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-11-12 00:55:10,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2023-11-12 00:55:10,378 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,378 INFO L899 garLoopResultBuilder]: For program point L635-1(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,379 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-11-12 00:55:10,379 INFO L899 garLoopResultBuilder]: For program point L635-5(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,379 INFO L899 garLoopResultBuilder]: For program point L635-6(line 635) no Hoare annotation was computed. [2023-11-12 00:55:10,379 INFO L895 garLoopResultBuilder]: At program point L635-7(lines 635 640) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (<= |ULTIMATE.start_main_~i~0#1| 0) .cse0) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) .cse0 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0)))) [2023-11-12 00:55:10,379 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2023-11-12 00:55:10,380 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= 2 |ULTIMATE.start_dll_circular_create_~len#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) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) [2023-11-12 00:55:10,380 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-12 00:55:10,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:55:10,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2023-11-12 00:55:10,380 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2023-11-12 00:55:10,381 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2023-11-12 00:55:10,381 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2023-11-12 00:55:10,381 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2023-11-12 00:55:10,381 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2023-11-12 00:55:10,382 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse1 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse2 (exists ((|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int)))) (= (let ((.cse15 (store |v_#memory_$Pointer$.base_88| .cse14 (store (select |v_#memory_$Pointer$.base_88| .cse14) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse15 |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse14))) |#memory_$Pointer$.base|))) (.cse4 (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (exists ((|v_#memory_int_235| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= |v_#memory_int_71| (store |v_#memory_int_235| .cse14 (store (select |v_#memory_int_235| .cse14) 0 (select (select |v_#memory_int_71| .cse14) 0)))) (= |#memory_int| (store |v_#memory_int_71| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))))))) (.cse10 (exists ((|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (let ((.cse13 (store |v_#memory_$Pointer$.offset_88| .cse14 (store (select |v_#memory_$Pointer$.offset_88| .cse14) 0 0)))) (store .cse13 |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse13 |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)))))) (.cse0 (<= 1 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_ULTIMATE.start_dll_circular_update_at_~index#1_38| Int)) (and (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|) (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| 1) (= 3 |ULTIMATE.start_dll_circular_update_at_#in~data#1|) (= |v_ULTIMATE.start_dll_circular_update_at_~index#1_38| 1) (= 3 |ULTIMATE.start_main_~new_data~0#1|) .cse8 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) 0) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) .cse9 .cse10 .cse11) (and (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse1 (exists ((|v_ULTIMATE.start_main_~new_data~0#1_20| Int)) (let ((.cse12 (= |ULTIMATE.start_main_~i~0#1| 0))) (and (or .cse12 (and .cse2 .cse4 .cse7 .cse10)) (or (and (= |v_ULTIMATE.start_main_~new_data~0#1_20| 3) .cse0 .cse12 .cse5 .cse9 .cse11) (and .cse0 .cse3 .cse5 .cse9 .cse11))))) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse6 .cse8 (= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))))) [2023-11-12 00:55:10,382 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-11-12 00:55:10,382 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-11-12 00:55:10,382 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-11-12 00:55:10,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2023-11-12 00:55:10,383 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_#memory_int_BEFORE_CALL_16| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_BEFORE_CALL_16| 1))) (and (= (select .cse8 0) 48) (= (select .cse8 1) 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) (exists ((|v_#valid_36| (Array Int Int))) (and (= (store |v_#valid_36| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|) (= (select |v_#valid_36| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) .cse4 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) .cse5 .cse6 (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_86| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int))) (|v_#memory_int_233| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse9 (select |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse9 8 1))) (= |v_#memory_int_48| (store |v_#memory_int_233| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_233| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse10 0)))) (= |v_#memory_int_47| (store |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse10 4 (select .cse9 4))))))) .cse7))) [2023-11-12 00:55:10,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2023-11-12 00:55:10,384 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) .cse0 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse0 (<= |ULTIMATE.start_main_~i~0#1| 1)))) [2023-11-12 00:55:10,384 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-12 00:55:10,384 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-12 00:55:10,384 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: true [2023-11-12 00:55:10,384 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-12 00:55:10,388 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:55:10,390 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:55:10,410 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,411 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) could not be translated [2023-11-12 00:55:10,411 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,412 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,412 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,413 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,413 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated [2023-11-12 00:55:10,413 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_dll_circular_update_at_~index#1_38 : int :: (((((((3 == ~data && ~index == 0) && #in~index == 1) && 3 == #in~data) && v_ULTIMATE.start_dll_circular_update_at_~index#1_38 == 1) && 3 == ~new_data~0) && #in~head!base == ~s~0!base) && #memory_$Pointer$.base[#in~head!base][0] == ~head!base) && #memory_$Pointer$.offset[#in~head!base][0] == ~head!offset) could not be translated [2023-11-12 00:55:10,413 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,414 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated [2023-11-12 00:55:10,414 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,414 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_20 : int :: (~i~0 == 0 || ((((exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) && #res!base == ~s~0!base) && (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]])) && (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]))) && ((((((v_ULTIMATE.start_main_~new_data~0#1_20 == 3 && 1 <= #StackHeapBarrier) && ~i~0 == 0) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0) || ((((1 <= #StackHeapBarrier && ~i~0 == 1) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated [2023-11-12 00:55:10,415 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,415 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,415 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,415 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,416 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,416 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,416 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,416 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,416 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,417 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,417 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,420 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,421 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) could not be translated [2023-11-12 00:55:10,421 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,421 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,421 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,422 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,422 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated [2023-11-12 00:55:10,422 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_dll_circular_update_at_~index#1_38 : int :: (((((((3 == ~data && ~index == 0) && #in~index == 1) && 3 == #in~data) && v_ULTIMATE.start_dll_circular_update_at_~index#1_38 == 1) && 3 == ~new_data~0) && #in~head!base == ~s~0!base) && #memory_$Pointer$.base[#in~head!base][0] == ~head!base) && #memory_$Pointer$.offset[#in~head!base][0] == ~head!offset) could not be translated [2023-11-12 00:55:10,423 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,423 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated [2023-11-12 00:55:10,423 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,423 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_20 : int :: (~i~0 == 0 || ((((exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) && #res!base == ~s~0!base) && (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]])) && (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]))) && ((((((v_ULTIMATE.start_main_~new_data~0#1_20 == 3 && 1 <= #StackHeapBarrier) && ~i~0 == 0) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0) || ((((1 <= #StackHeapBarrier && ~i~0 == 1) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated [2023-11-12 00:55:10,424 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,424 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,424 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,424 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,425 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,425 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,425 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,425 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,425 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,426 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,426 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,429 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_16 : [int,int]int :: v_#memory_int_BEFORE_CALL_16[1][0] == 48 && v_#memory_int_BEFORE_CALL_16[1][1] == 0) could not be translated [2023-11-12 00:55:10,429 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_28 : [int]int :: #length == v_#length_28[~head~0!base := 12]) could not be translated [2023-11-12 00:55:10,430 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_36 : [int]int :: v_#valid_36[~head~0!base := 1] == #valid && v_#valid_36[~head~0!base] == 0) could not be translated [2023-11-12 00:55:10,430 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_86 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_86[~head~0!base := v_#memory_$Pointer$.offset_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,430 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_86 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_86[~head~0!base := v_#memory_$Pointer$.base_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,430 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int, v_#memory_int_233 : [int,int]int :: (#memory_int == v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][8 := 1]] && v_#memory_int_48 == v_#memory_int_233[~head~0!base := v_#memory_int_233[~head~0!base][0 := v_#memory_int_48[~head~0!base][0]]]) && v_#memory_int_47 == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][4 := v_#memory_int_47[~head~0!base][4]]]) could not be translated [2023-11-12 00:55:10,432 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_16 : [int,int]int :: v_#memory_int_BEFORE_CALL_16[1][0] == 48 && v_#memory_int_BEFORE_CALL_16[1][1] == 0) could not be translated [2023-11-12 00:55:10,433 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_28 : [int]int :: #length == v_#length_28[~head~0!base := 12]) could not be translated [2023-11-12 00:55:10,433 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_36 : [int]int :: v_#valid_36[~head~0!base := 1] == #valid && v_#valid_36[~head~0!base] == 0) could not be translated [2023-11-12 00:55:10,433 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_86 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_86[~head~0!base := v_#memory_$Pointer$.offset_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,433 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_86 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_86[~head~0!base := v_#memory_$Pointer$.base_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,434 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int, v_#memory_int_233 : [int,int]int :: (#memory_int == v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][8 := 1]] && v_#memory_int_48 == v_#memory_int_233[~head~0!base := v_#memory_int_233[~head~0!base][0 := v_#memory_int_48[~head~0!base][0]]]) && v_#memory_int_47 == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][4 := v_#memory_int_47[~head~0!base][4]]]) could not be translated [2023-11-12 00:55:10,434 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,435 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,436 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,436 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,436 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,436 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:55:10,437 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,437 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-11-12 00:55:10,437 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,437 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,438 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,438 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,438 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,438 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,438 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,439 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,439 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,440 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,440 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,440 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:55:10,440 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,440 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-11-12 00:55:10,441 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,441 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,441 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,441 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,442 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,442 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,442 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,442 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,443 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,443 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:55:10 BoogieIcfgContainer [2023-11-12 00:55:10,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:55:10,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:55:10,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:55:10,445 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:55:10,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:20" (3/4) ... [2023-11-12 00:55:10,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:55:10,451 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-12 00:55:10,464 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2023-11-12 00:55:10,464 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-12 00:55:10,465 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 00:55:10,465 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:55:10,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1))) [2023-11-12 00:55:10,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((data == 1) || ((\old(data) == data) && (\old(index) == index))) [2023-11-12 00:55:10,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((index == 1) && (\old(index) == 1)) || (index <= 0)) [2023-11-12 00:55:10,516 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1))) [2023-11-12 00:55:10,519 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((data == 1) || ((\old(data) == data) && (\old(index) == index))) [2023-11-12 00:55:10,520 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((index == 1) && (\old(index) == 1)) || (index <= 0)) [2023-11-12 00:55:10,567 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:55:10,568 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:55:10,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:55:10,568 INFO L158 Benchmark]: Toolchain (without parser) took 51658.94ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 119.0MB in the beginning and 320.0MB in the end (delta: -201.0MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,569 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 121.6MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:55:10,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.54ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 110.5MB in the end (delta: 8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.94ms. Allocated memory is still 155.2MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,570 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 106.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,570 INFO L158 Benchmark]: RCFGBuilder took 601.06ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 82.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,571 INFO L158 Benchmark]: TraceAbstraction took 50280.38ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 81.9MB in the beginning and 326.3MB in the end (delta: -244.4MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,571 INFO L158 Benchmark]: Witness Printer took 123.23ms. Allocated memory is still 465.6MB. Free memory was 326.3MB in the beginning and 320.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 00:55:10,573 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.22ms. Allocated memory is still 121.6MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.54ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 110.5MB in the end (delta: 8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.94ms. Allocated memory is still 155.2MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 106.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.06ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 82.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50280.38ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 81.9MB in the beginning and 326.3MB in the end (delta: -244.4MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB. * Witness Printer took 123.23ms. Allocated memory is still 465.6MB. Free memory was 326.3MB in the beginning and 320.0MB 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 #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_dll_circular_update_at_~index#1_38 : int :: (((((((3 == ~data && ~index == 0) && #in~index == 1) && 3 == #in~data) && v_ULTIMATE.start_dll_circular_update_at_~index#1_38 == 1) && 3 == ~new_data~0) && #in~head!base == ~s~0!base) && #memory_$Pointer$.base[#in~head!base][0] == ~head!base) && #memory_$Pointer$.offset[#in~head!base][0] == ~head!offset) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_20 : int :: (~i~0 == 0 || ((((exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) && #res!base == ~s~0!base) && (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]])) && (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]))) && ((((((v_ULTIMATE.start_main_~new_data~0#1_20 == 3 && 1 <= #StackHeapBarrier) && ~i~0 == 0) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0) || ((((1 <= #StackHeapBarrier && ~i~0 == 1) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~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: QuantifierExpression (exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_dll_circular_update_at_~index#1_38 : int :: (((((((3 == ~data && ~index == 0) && #in~index == 1) && 3 == #in~data) && v_ULTIMATE.start_dll_circular_update_at_~index#1_38 == 1) && 3 == ~new_data~0) && #in~head!base == ~s~0!base) && #memory_$Pointer$.base[#in~head!base][0] == ~head!base) && #memory_$Pointer$.offset[#in~head!base][0] == ~head!offset) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_20 : int :: (~i~0 == 0 || ((((exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) && #res!base == ~s~0!base) && (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]])) && (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]))) && ((((((v_ULTIMATE.start_main_~new_data~0#1_20 == 3 && 1 <= #StackHeapBarrier) && ~i~0 == 0) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0) || ((((1 <= #StackHeapBarrier && ~i~0 == 1) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~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: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_16 : [int,int]int :: v_#memory_int_BEFORE_CALL_16[1][0] == 48 && v_#memory_int_BEFORE_CALL_16[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_28 : [int]int :: #length == v_#length_28[~head~0!base := 12]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_36 : [int]int :: v_#valid_36[~head~0!base := 1] == #valid && v_#valid_36[~head~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_86 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_86[~head~0!base := v_#memory_$Pointer$.offset_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_86 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_86[~head~0!base := v_#memory_$Pointer$.base_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int, v_#memory_int_233 : [int,int]int :: (#memory_int == v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][8 := 1]] && v_#memory_int_48 == v_#memory_int_233[~head~0!base := v_#memory_int_233[~head~0!base][0 := v_#memory_int_48[~head~0!base][0]]]) && v_#memory_int_47 == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][4 := v_#memory_int_47[~head~0!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_16 : [int,int]int :: v_#memory_int_BEFORE_CALL_16[1][0] == 48 && v_#memory_int_BEFORE_CALL_16[1][1] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_28 : [int]int :: #length == v_#length_28[~head~0!base := 12]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_36 : [int]int :: v_#valid_36[~head~0!base := 1] == #valid && v_#valid_36[~head~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_86 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_86[~head~0!base := v_#memory_$Pointer$.offset_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_86 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_86[~head~0!base := v_#memory_$Pointer$.base_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int, v_#memory_int_233 : [int,int]int :: (#memory_int == v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][8 := 1]] && v_#memory_int_48 == v_#memory_int_233[~head~0!base := v_#memory_int_233[~head~0!base][0 := v_#memory_int_48[~head~0!base][0]]]) && v_#memory_int_47 == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][4 := v_#memory_int_47[~head~0!base][4]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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 ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~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: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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 ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~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: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression * 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: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: 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: 50.1s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 628 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 1449 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1736 IncrementalHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 502 mSDtfsCounter, 1736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 345 SyntacticMatches, 28 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 121, 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, 19 MinimizatonAttempts, 125 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 937 HoareAnnotationTreeSize, 11 FomulaSimplifications, 9468 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1944 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 712 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 1945 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1893 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 229/248 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: 9.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 63, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 136, TOOLS_POST_TIME: 2.4s, TOOLS_POST_CALL_APPLICATIONS: 16, TOOLS_POST_CALL_TIME: 0.5s, TOOLS_POST_RETURN_APPLICATIONS: 12, TOOLS_POST_RETURN_TIME: 1.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 154, TOOLS_QUANTIFIERELIM_TIME: 3.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 252, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 29, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 15, DOMAIN_ISSUBSETEQ_TIME: 4.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 63, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 12, LOOP_SUMMARIZER_CACHE_MISSES: 12, LOOP_SUMMARIZER_OVERALL_TIME: 5.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 15, CALL_SUMMARIZER_APPLICATIONS: 12, CALL_SUMMARIZER_CACHE_MISSES: 2, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 2465, DAG_COMPRESSION_RETAINED_NODES: 192, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant [2023-11-12 00:55:10,596 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,597 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) could not be translated [2023-11-12 00:55:10,597 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,597 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,597 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,598 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,598 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated [2023-11-12 00:55:10,598 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_dll_circular_update_at_~index#1_38 : int :: (((((((3 == ~data && ~index == 0) && #in~index == 1) && 3 == #in~data) && v_ULTIMATE.start_dll_circular_update_at_~index#1_38 == 1) && 3 == ~new_data~0) && #in~head!base == ~s~0!base) && #memory_$Pointer$.base[#in~head!base][0] == ~head!base) && #memory_$Pointer$.offset[#in~head!base][0] == ~head!offset) could not be translated [2023-11-12 00:55:10,598 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,598 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated [2023-11-12 00:55:10,599 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,599 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_20 : int :: (~i~0 == 0 || ((((exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) && #res!base == ~s~0!base) && (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]])) && (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]))) && ((((((v_ULTIMATE.start_main_~new_data~0#1_20 == 3 && 1 <= #StackHeapBarrier) && ~i~0 == 0) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0) || ((((1 <= #StackHeapBarrier && ~i~0 == 1) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated [2023-11-12 00:55:10,599 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,599 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,600 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,600 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,600 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,600 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,600 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,600 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,601 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,601 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,601 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,603 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,604 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) could not be translated [2023-11-12 00:55:10,604 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,604 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,604 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,605 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,605 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]]) could not be translated [2023-11-12 00:55:10,605 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_dll_circular_update_at_~index#1_38 : int :: (((((((3 == ~data && ~index == 0) && #in~index == 1) && 3 == #in~data) && v_ULTIMATE.start_dll_circular_update_at_~index#1_38 == 1) && 3 == ~new_data~0) && #in~head!base == ~s~0!base) && #memory_$Pointer$.base[#in~head!base][0] == ~head!base) && #memory_$Pointer$.offset[#in~head!base][0] == ~head!offset) could not be translated [2023-11-12 00:55:10,605 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,605 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]) could not be translated [2023-11-12 00:55:10,606 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,606 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_20 : int :: (~i~0 == 0 || ((((exists v_#memory_$Pointer$.base_88 : [int,int]int :: v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.base_88[#memory_$Pointer$.base[#res!base][4]][0 := #res!base]][#res!base][4 := #memory_$Pointer$.base[#res!base][4]]] == #memory_$Pointer$.base) && #res!base == ~s~0!base) && (exists v_#memory_int_235 : [int,int]int, v_#memory_int_71 : [int,int]int :: v_#memory_int_71 == v_#memory_int_235[#memory_$Pointer$.base[#res!base][4] := v_#memory_int_235[#memory_$Pointer$.base[#res!base][4]][0 := v_#memory_int_71[#memory_$Pointer$.base[#res!base][4]][0]]] && #memory_int == v_#memory_int_71[#res!base := v_#memory_int_71[#res!base][4 := #memory_int[#res!base][4]]])) && (exists v_#memory_$Pointer$.offset_88 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4] := v_#memory_$Pointer$.offset_88[#memory_$Pointer$.base[#res!base][4]][0 := 0]][#res!base][4 := 0]]))) && ((((((v_ULTIMATE.start_main_~new_data~0#1_20 == 3 && 1 <= #StackHeapBarrier) && ~i~0 == 0) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0) || ((((1 <= #StackHeapBarrier && ~i~0 == 1) && ~data~0 == 1) && #res!offset == 0) && ~s~0!offset == 0))) could not be translated [2023-11-12 00:55:10,606 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,606 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,608 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,608 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-12 00:55:10,608 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 Derived loop invariant: ((data == 1) || ((\old(data) == data) && (\old(index) == index))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2023-11-12 00:55:10,609 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_16 : [int,int]int :: v_#memory_int_BEFORE_CALL_16[1][0] == 48 && v_#memory_int_BEFORE_CALL_16[1][1] == 0) could not be translated [2023-11-12 00:55:10,610 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_28 : [int]int :: #length == v_#length_28[~head~0!base := 12]) could not be translated [2023-11-12 00:55:10,610 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_36 : [int]int :: v_#valid_36[~head~0!base := 1] == #valid && v_#valid_36[~head~0!base] == 0) could not be translated [2023-11-12 00:55:10,610 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_86 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_86[~head~0!base := v_#memory_$Pointer$.offset_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,610 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_86 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_86[~head~0!base := v_#memory_$Pointer$.base_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,611 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int, v_#memory_int_233 : [int,int]int :: (#memory_int == v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][8 := 1]] && v_#memory_int_48 == v_#memory_int_233[~head~0!base := v_#memory_int_233[~head~0!base][0 := v_#memory_int_48[~head~0!base][0]]]) && v_#memory_int_47 == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][4 := v_#memory_int_47[~head~0!base][4]]]) could not be translated [2023-11-12 00:55:10,612 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_BEFORE_CALL_16 : [int,int]int :: v_#memory_int_BEFORE_CALL_16[1][0] == 48 && v_#memory_int_BEFORE_CALL_16[1][1] == 0) could not be translated [2023-11-12 00:55:10,612 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_28 : [int]int :: #length == v_#length_28[~head~0!base := 12]) could not be translated [2023-11-12 00:55:10,612 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_36 : [int]int :: v_#valid_36[~head~0!base := 1] == #valid && v_#valid_36[~head~0!base] == 0) could not be translated [2023-11-12 00:55:10,613 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_86 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_86[~head~0!base := v_#memory_$Pointer$.offset_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,613 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_86 : [int,int]int :: #memory_$Pointer$.base == v_#memory_$Pointer$.base_86[~head~0!base := v_#memory_$Pointer$.base_86[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]]) could not be translated [2023-11-12 00:55:10,613 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int, v_#memory_int_233 : [int,int]int :: (#memory_int == v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][8 := 1]] && v_#memory_int_48 == v_#memory_int_233[~head~0!base := v_#memory_int_233[~head~0!base][0 := v_#memory_int_48[~head~0!base][0]]]) && v_#memory_int_47 == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][4 := v_#memory_int_47[~head~0!base][4]]]) could not be translated Derived loop invariant: (((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1))) - InvariantResult [Line: 631]: Loop Invariant [2023-11-12 00:55:10,614 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,614 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: ((((0 <= (i + 1)) && (data == 1)) && (len == 2)) && (i <= 1)) - InvariantResult [Line: 613]: Loop Invariant [2023-11-12 00:55:10,615 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,615 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,615 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,615 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:55:10,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-11-12 00:55:10,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:55:10,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:55:10,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,619 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-11-12 00:55:10,619 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,619 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,619 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,619 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,620 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,620 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:55:10,620 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:55:10,620 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 Derived loop invariant: (((index == 1) && (\old(index) == 1)) || (index <= 0)) - InvariantResult [Line: 635]: Loop Invariant [2023-11-12 00:55:10,621 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:55:10,621 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: (((i <= 0) && (len == 2)) || (((i == 1) && (data == 1)) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2023-11-12 00:55:10,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c016ac16-8b43-4137-9200-6db73492c61c/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE