./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/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_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/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_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:57:29,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:57:29,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:57:29,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:57:29,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:57:29,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:57:29,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:57:29,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:57:29,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:57:29,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:57:29,654 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:57:29,655 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:57:29,655 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:57:29,657 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:57:29,657 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:57:29,658 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:57:29,658 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:57:29,659 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:57:29,659 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:57:29,660 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:57:29,660 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:57:29,661 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:57:29,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:57:29,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:57:29,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:57:29,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:57:29,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:57:29,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:57:29,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:57:29,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:57:29,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:57:29,666 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:57:29,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:57:29,667 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:57:29,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:57:29,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:57:29,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:57:29,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:57:29,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:57:29,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:57:29,669 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:57:29,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:57:29,669 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:57:29,669 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:57:29,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:57:29,670 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_2390acf6-8732-434a-94e1-39f731a511d0/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_2390acf6-8732-434a-94e1-39f731a511d0/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2023-11-12 00:57:29,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:57:30,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:57:30,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:57:30,028 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:57:30,028 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:57:30,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2023-11-12 00:57:33,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:57:33,598 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:57:33,599 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2023-11-12 00:57:33,623 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/data/7e27808e7/a9bae19e861a473b9928e8dfb04d69e1/FLAG18c1ac22b [2023-11-12 00:57:33,643 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/data/7e27808e7/a9bae19e861a473b9928e8dfb04d69e1 [2023-11-12 00:57:33,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:57:33,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:57:33,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:57:33,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:57:33,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:57:33,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:33" (1/1) ... [2023-11-12 00:57:33,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28cf1d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:33, skipping insertion in model container [2023-11-12 00:57:33,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:33" (1/1) ... [2023-11-12 00:57:33,725 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:57:34,150 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-11-12 00:57:34,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:57:34,172 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:57:34,234 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-11-12 00:57:34,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:57:34,278 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:57:34,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34 WrapperNode [2023-11-12 00:57:34,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:57:34,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:57:34,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:57:34,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:57:34,288 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:57:34" (1/1) ... [2023-11-12 00:57:34,313 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:57:34" (1/1) ... [2023-11-12 00:57:34,345 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 135 [2023-11-12 00:57:34,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:57:34,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:57:34,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:57:34,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:57:34,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:57:34,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:57:34,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:57:34,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:57:34,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (1/1) ... [2023-11-12 00:57:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:57:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:34,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/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:57:34,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/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:57:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:57:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:57:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:57:34,477 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:57:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:57:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:57:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:57:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:57:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:57:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:57:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:57:34,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:57:34,611 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:57:34,613 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:57:34,863 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:57:34,945 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:57:34,945 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-12 00:57:34,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:34 BoogieIcfgContainer [2023-11-12 00:57:34,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:57:34,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:57:34,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:57:34,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:57:34,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:33" (1/3) ... [2023-11-12 00:57:34,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af4043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:34, skipping insertion in model container [2023-11-12 00:57:34,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:34" (2/3) ... [2023-11-12 00:57:34,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af4043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:34, skipping insertion in model container [2023-11-12 00:57:34,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:34" (3/3) ... [2023-11-12 00:57:34,958 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2023-11-12 00:57:34,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:57:34,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:57:35,050 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:57:35,057 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;@6310373e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:57:35,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:57:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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:57:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:57:35,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:35,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:35,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:35,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash 165599205, now seen corresponding path program 1 times [2023-11-12 00:57:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208868657] [2023-11-12 00:57:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:35,485 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:57:35,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208868657] [2023-11-12 00:57:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208868657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:35,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:57:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062954781] [2023-11-12 00:57:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:35,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:57:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:35,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:57:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:57:35,532 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:57:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:35,624 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2023-11-12 00:57:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:57:35,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-11-12 00:57:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:35,634 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:57:35,635 INFO L226 Difference]: Without dead ends: 19 [2023-11-12 00:57:35,639 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:57:35,645 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:35,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-12 00:57:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-11-12 00:57:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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:57:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-11-12 00:57:35,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2023-11-12 00:57:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:35,690 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-11-12 00:57:35,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:57:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-12 00:57:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:57:35,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:35,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:35,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:57:35,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:35,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash 523554530, now seen corresponding path program 1 times [2023-11-12 00:57:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020934695] [2023-11-12 00:57:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:35,922 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:57:35,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:35,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020934695] [2023-11-12 00:57:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020934695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:57:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907012629] [2023-11-12 00:57:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:35,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:57:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:57:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:57:35,927 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:57:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:35,995 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-11-12 00:57:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:57:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2023-11-12 00:57:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:35,997 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:57:35,997 INFO L226 Difference]: Without dead ends: 24 [2023-11-12 00:57:35,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:57:35,999 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:36,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:57:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-12 00:57:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-11-12 00:57:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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:57:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-11-12 00:57:36,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2023-11-12 00:57:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:36,010 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-11-12 00:57:36,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:57:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-11-12 00:57:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:57:36,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:36,013 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:57:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:57:36,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:36,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 517856597, now seen corresponding path program 1 times [2023-11-12 00:57:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659317689] [2023-11-12 00:57:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:57:36,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659317689] [2023-11-12 00:57:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659317689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:57:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526576438] [2023-11-12 00:57:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:36,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:57:36,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:57:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:57:36,399 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:57:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:36,514 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-11-12 00:57:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:57:36,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:57:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:36,517 INFO L225 Difference]: With dead ends: 32 [2023-11-12 00:57:36,518 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:57:36,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:57:36,526 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:36,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:57:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-11-12 00:57:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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:57:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-12 00:57:36,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20 [2023-11-12 00:57:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:36,546 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-12 00:57:36,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:57:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-12 00:57:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:57:36,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:36,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:36,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:57:36,548 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:36,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash 250342324, now seen corresponding path program 1 times [2023-11-12 00:57:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356218334] [2023-11-12 00:57:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:36,721 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:57:36,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356218334] [2023-11-12 00:57:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356218334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106306948] [2023-11-12 00:57:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:36,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:36,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:36,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:57:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:36,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:57:36,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:37,011 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:57:37,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:37,095 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:57:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106306948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2087301955] [2023-11-12 00:57:37,116 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:57:37,116 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:37,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:37,126 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:37,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:39,138 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:57:39,157 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:40,028 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '401#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~expected~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 1) (= |ULTIMATE.start_dll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8))) (not (= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 1)))' at error location [2023-11-12 00:57:40,028 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:40,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-12 00:57:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723223032] [2023-11-12 00:57:40,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:40,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:57:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:40,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:57:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-11-12 00:57:40,031 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:57:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:40,141 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-11-12 00:57:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:57:40,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 21 [2023-11-12 00:57:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:40,143 INFO L225 Difference]: With dead ends: 32 [2023-11-12 00:57:40,143 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:57:40,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:57:40,145 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:40,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:57:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2023-11-12 00:57:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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:57:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-11-12 00:57:40,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 21 [2023-11-12 00:57:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:40,156 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-12 00:57:40,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:57:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-11-12 00:57:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:57:40,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:40,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:40,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:40,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:40,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:40,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -46068313, now seen corresponding path program 2 times [2023-11-12 00:57:40,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:40,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806965881] [2023-11-12 00:57:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:57:40,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:40,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806965881] [2023-11-12 00:57:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806965881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:40,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:57:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994806844] [2023-11-12 00:57:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:40,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:57:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:57:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:57:40,503 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:57:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:40,573 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-11-12 00:57:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:57:40,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:57:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:40,574 INFO L225 Difference]: With dead ends: 32 [2023-11-12 00:57:40,574 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:57:40,575 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:57:40,576 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:40,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:57:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-11-12 00:57:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:57:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 00:57:40,583 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 23 [2023-11-12 00:57:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:40,583 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 00:57:40,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:57:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 00:57:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:57:40,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:40,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:40,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:57:40,585 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:40,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1430491229, now seen corresponding path program 1 times [2023-11-12 00:57:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41388132] [2023-11-12 00:57:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:57:43,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41388132] [2023-11-12 00:57:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41388132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265233326] [2023-11-12 00:57:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:43,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:43,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:43,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:57:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:43,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-12 00:57:43,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:43,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:57:43,520 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:57:43,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:57:43,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 00:57:43,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:43,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 00:57:43,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:57:43,670 INFO L322 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2023-11-12 00:57:43,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 40 [2023-11-12 00:57:43,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:43,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-12 00:57:43,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-12 00:57:43,954 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 00:57:43,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2023-11-12 00:57:43,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-12 00:57:43,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-12 00:57:44,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:44,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-12 00:57:44,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:57:44,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:57:44,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-12 00:57:44,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-12 00:57:44,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:57:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:57:44,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:44,649 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (or (not (= v_ArrVal_491 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_491 .cse0)))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1)) (not (= v_ArrVal_493 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_493 .cse0))))))) is different from false [2023-11-12 00:57:44,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_492) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2023-11-12 00:57:44,715 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:44,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2023-11-12 00:57:44,729 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:44,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2023-11-12 00:57:44,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-11-12 00:57:44,820 WARN L854 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_DerPreprocessor_3 Int) (v_ArrVal_488 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_488) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_490 (Array Int Int)) (v_DerPreprocessor_2 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_490 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|))))) is different from false [2023-11-12 00:57:44,868 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (forall ((v_DerPreprocessor_3 Int) (v_ArrVal_488 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_488) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_490 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_490 (Array Int Int)) (v_DerPreprocessor_2 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2023-11-12 00:57:44,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_490 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_490 (Array Int Int)) (v_DerPreprocessor_2 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| Int)) (or (forall ((v_DerPreprocessor_3 Int) (v_ArrVal_488 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_488) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| 8) v_DerPreprocessor_3) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_37| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-12 00:57:45,313 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:45,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2023-11-12 00:57:45,329 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:45,329 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 77 [2023-11-12 00:57:45,427 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:57:45,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 18 [2023-11-12 00:57:45,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:45,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:45,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:45,578 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:57:45,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 18 [2023-11-12 00:57:45,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:45,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:45,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:45,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 324 [2023-11-12 00:57:45,820 INFO L322 Elim1Store]: treesize reduction 64, result has 60.2 percent of original size [2023-11-12 00:57:45,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 470 treesize of output 440 [2023-11-12 00:57:45,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 247 [2023-11-12 00:57:45,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 206 [2023-11-12 00:57:45,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 215 [2023-11-12 00:57:45,962 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-12 00:57:45,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 236 treesize of output 222 [2023-11-12 00:57:45,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 199 [2023-11-12 00:57:46,023 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:57:46,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 240 [2023-11-12 00:57:46,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 219 [2023-11-12 00:57:46,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:46,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 00:57:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-12 00:57:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265233326] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:47,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169403299] [2023-11-12 00:57:47,054 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:57:47,054 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:47,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:47,054 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:47,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:48,428 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:57:48,439 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:48,972 WARN L876 $PredicateComparison]: unable to prove that (and (= 2 |c_ULTIMATE.start_dll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (let ((.cse0 (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 12) |c_#length|))) (.cse1 (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0))) (.cse2 (<= (+ |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store (store (store (select |v_#memory_$Pointer$.base_97| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0 0) 4 0) 8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 8))) |c_#memory_$Pointer$.base|))) (.cse4 (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_162| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_52| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (.cse10 (select |v_#memory_int_51| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))) (and (= |v_#memory_int_51| (store |v_#memory_int_52| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store .cse9 4 (select .cse10 4)))) (= (store |v_#memory_int_162| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_162| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0 (select .cse9 0))) |v_#memory_int_52|) (= (store |v_#memory_int_51| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store .cse10 8 1)) |c_#memory_int|))))) (.cse6 (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_97| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0 0) 4 0) 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 8))) |c_#memory_$Pointer$.offset|))) (.cse7 (exists ((|v_#valid_42| (Array Int Int))) (and (= (select |v_#valid_42| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_42| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 1)))))) (or (and (exists ((|v_#length_BEFORE_CALL_18| (Array Int Int))) (and (= (select |v_#length_BEFORE_CALL_18| 1) 2) (= (select |v_#length_BEFORE_CALL_18| 2) 27))) .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| 2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| 0) 0) (= (select |v_old(#valid)_AFTER_CALL_12| 1) 1))) (exists ((|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_int_BEFORE_CALL_18| 1))) (and (= (select .cse5 0) 48) (= (select .cse5 1) 0)))) .cse6 .cse7) (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| 2) 1) (= (select |v_old(#valid)_AFTER_CALL_11| 1) 1))) .cse0 (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)))) .cse1 .cse2 (exists ((|v_#length_BEFORE_CALL_16| (Array Int Int))) (and (= (select |v_#length_BEFORE_CALL_16| 2) 27) (= 2 (select |v_#length_BEFORE_CALL_16| 1)))) .cse3 .cse4 .cse6 .cse7))) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-12 00:57:49,800 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '785#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_24| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_24| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_24|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_24| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-11-12 00:57:49,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:49,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 50 [2023-11-12 00:57:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253049392] [2023-11-12 00:57:49,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-12 00:57:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-12 00:57:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3001, Unknown=9, NotChecked=690, Total=3906 [2023-11-12 00:57:49,806 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:57:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:51,809 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2023-11-12 00:57:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 00:57:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-11-12 00:57:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:51,812 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:57:51,813 INFO L226 Difference]: Without dead ends: 48 [2023-11-12 00:57:51,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=294, Invalid=3881, Unknown=9, NotChecked=786, Total=4970 [2023-11-12 00:57:51,816 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 93 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:51,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 231 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 742 Invalid, 0 Unknown, 265 Unchecked, 1.1s Time] [2023-11-12 00:57:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-12 00:57:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2023-11-12 00:57:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 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:57:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2023-11-12 00:57:51,828 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2023-11-12 00:57:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:51,828 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2023-11-12 00:57:51,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:57:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2023-11-12 00:57:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:57:51,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:51,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:51,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:52,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:52,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:52,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1397928665, now seen corresponding path program 2 times [2023-11-12 00:57:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072408615] [2023-11-12 00:57:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:57:52,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:52,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072408615] [2023-11-12 00:57:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072408615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:57:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:57:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256865730] [2023-11-12 00:57:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:52,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:57:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:57:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:57:52,178 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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:57:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:52,252 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-11-12 00:57:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:57:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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 25 [2023-11-12 00:57:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:52,256 INFO L225 Difference]: With dead ends: 42 [2023-11-12 00:57:52,256 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:57:52,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:57:52,257 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:52,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 35 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:57:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 00:57:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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:57:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-11-12 00:57:52,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2023-11-12 00:57:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:52,276 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-11-12 00:57:52,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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:57:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-11-12 00:57:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:57:52,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:52,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:52,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:57:52,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:52,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1597655288, now seen corresponding path program 3 times [2023-11-12 00:57:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272461763] [2023-11-12 00:57:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:52,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272461763] [2023-11-12 00:57:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272461763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743371440] [2023-11-12 00:57:52,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:57:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:52,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:52,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:52,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:57:52,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:57:52,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:57:52,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:57:52,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:57:52,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:57:52,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743371440] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:52,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1304605399] [2023-11-12 00:57:52,705 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:57:52,706 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:52,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:52,706 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:52,707 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:54,046 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:57:54,060 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:54,301 WARN L876 $PredicateComparison]: unable to prove that (and (= 2 |c_ULTIMATE.start_dll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (let ((.cse0 (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_52| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|)) (.cse10 (select |v_#memory_int_51| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))) (and (= |v_#memory_int_52| (store |v_#memory_int_196| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_196| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0 (select .cse9 0)))) (= |v_#memory_int_51| (store |v_#memory_int_52| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store .cse9 4 (select .cse10 4)))) (= (store |v_#memory_int_51| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store .cse10 8 1)) |c_#memory_int|))))) (.cse1 (exists ((|v_#valid_50| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_50| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 1)) (= (select |v_#valid_50| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0)))) (.cse2 (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_113| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_113| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0 0) 4 0) 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 8)))))) (.cse3 (exists ((|v_#length_38| (Array Int Int))) (= (store |v_#length_38| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 12) |c_#length|))) (.cse4 (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0))) (.cse5 (<= (+ |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse7 (exists ((|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_113| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| (store (store (store (select |v_#memory_$Pointer$.base_113| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0 0) 4 0) 8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 8))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_#memory_int_BEFORE_CALL_30| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_#memory_int_BEFORE_CALL_30| 1))) (and (= (select .cse6 1) 0) (= 48 (select .cse6 0))))) .cse7 (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| 2) 1) (= (select |v_old(#valid)_AFTER_CALL_19| 1) 1))) (exists ((|v_#length_BEFORE_CALL_30| (Array Int Int))) (and (= 2 (select |v_#length_BEFORE_CALL_30| 1)) (= (select |v_#length_BEFORE_CALL_30| 2) 27)))) (and .cse0 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| 0) 0) (= (select |v_old(#valid)_AFTER_CALL_20| 2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| 1) 1))) .cse2 .cse3 .cse4 .cse5 (exists ((|v_#length_BEFORE_CALL_32| (Array Int Int))) (and (= 2 (select |v_#length_BEFORE_CALL_32| 1)) (= (select |v_#length_BEFORE_CALL_32| 2) 27))) .cse7 (exists ((|v_#memory_int_BEFORE_CALL_32| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_int_BEFORE_CALL_32| 1))) (and (= (select .cse8 1) 0) (= (select .cse8 0) 48))))))) (= |c_ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-12 00:57:54,724 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1261#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_30| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_30| Int)) (= |ULTIMATE.start_dll_circular_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_30|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_30| 8)))) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-11-12 00:57:54,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:54,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-11-12 00:57:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520197653] [2023-11-12 00:57:54,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:54,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:57:54,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:54,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:57:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=439, Unknown=2, NotChecked=42, Total=552 [2023-11-12 00:57:54,730 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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:57:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:54,907 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-11-12 00:57:54,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:57:54,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 25 [2023-11-12 00:57:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:54,911 INFO L225 Difference]: With dead ends: 51 [2023-11-12 00:57:54,911 INFO L226 Difference]: Without dead ends: 41 [2023-11-12 00:57:54,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=643, Unknown=2, NotChecked=52, Total=812 [2023-11-12 00:57:54,913 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:54,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 78 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-12 00:57:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-11-12 00:57:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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:57:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-11-12 00:57:54,925 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 25 [2023-11-12 00:57:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:54,925 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-11-12 00:57:54,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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:57:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-11-12 00:57:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:57:54,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:54,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:57:54,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:55,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:55,133 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:55,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1370605950, now seen corresponding path program 4 times [2023-11-12 00:57:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611460206] [2023-11-12 00:57:55,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:57:55,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:55,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611460206] [2023-11-12 00:57:55,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611460206] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:55,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886510226] [2023-11-12 00:57:55,276 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-12 00:57:55,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:55,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:55,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:55,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:57:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:55,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:57:55,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:57:55,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:57:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886510226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:57:55,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:57:55,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-12 00:57:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438971521] [2023-11-12 00:57:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:57:55,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:57:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:57:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:57:55,511 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:57:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:55,600 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-11-12 00:57:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:57:55,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:57:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:55,601 INFO L225 Difference]: With dead ends: 49 [2023-11-12 00:57:55,601 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:57:55,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:57:55,603 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:55,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:57:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:57:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 00:57:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:57:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-11-12 00:57:55,615 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2023-11-12 00:57:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:55,615 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-11-12 00:57:55,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:57:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-11-12 00:57:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:57:55,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:55,617 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] [2023-11-12 00:57:55,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:55,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:55,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:57:55,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1052870022, now seen corresponding path program 1 times [2023-11-12 00:57:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316687043] [2023-11-12 00:57:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:55,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:57:56,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316687043] [2023-11-12 00:57:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316687043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545798240] [2023-11-12 00:57:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:56,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:56,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:56,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:56,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:57:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:57,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-12 00:57:57,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:57,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 00:57:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:57,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:57:57,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-12 00:57:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:57:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545798240] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:57:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [564724041] [2023-11-12 00:57:57,559 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:57:57,559 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:57:57,560 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:57:57,560 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:57:57,560 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:57:59,044 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:57:59,054 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:58:00,511 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1858#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_41| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_41| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_41|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_41| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_main_~expected~0#1|) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-11-12 00:58:00,511 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:58:00,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:58:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 30 [2023-11-12 00:58:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219361923] [2023-11-12 00:58:00,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:58:00,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-12 00:58:00,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:58:00,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-12 00:58:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1658, Unknown=3, NotChecked=0, Total=1806 [2023-11-12 00:58:00,514 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-12 00:58:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:58:01,218 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2023-11-12 00:58:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 00:58:01,219 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-11-12 00:58:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:58:01,219 INFO L225 Difference]: With dead ends: 47 [2023-11-12 00:58:01,220 INFO L226 Difference]: Without dead ends: 45 [2023-11-12 00:58:01,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=256, Invalid=2393, Unknown=3, NotChecked=0, Total=2652 [2023-11-12 00:58:01,222 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 61 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:58:01,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 214 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:58:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-12 00:58:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2023-11-12 00:58:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:58:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-11-12 00:58:01,234 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2023-11-12 00:58:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:58:01,235 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-11-12 00:58:01,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-12 00:58:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-11-12 00:58:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:58:01,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:58:01,236 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] [2023-11-12 00:58:01,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:58:01,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:01,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:58:01,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:58:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1718394160, now seen corresponding path program 2 times [2023-11-12 00:58:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:58:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563260762] [2023-11-12 00:58:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:58:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:58:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:58:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-12 00:58:01,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:58:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563260762] [2023-11-12 00:58:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563260762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:58:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204756903] [2023-11-12 00:58:01,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:58:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:01,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:58:01,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:58:01,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:58:01,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 00:58:01,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:58:01,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:58:01,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:58:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-12 00:58:01,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:58:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-12 00:58:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204756903] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:58:02,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2147176942] [2023-11-12 00:58:02,036 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:58:02,036 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:58:02,037 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:58:02,037 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:58:02,037 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:58:03,408 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:58:03,417 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:58:04,220 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2202#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_52| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_52| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_52|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_52| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_main_~expected~0#1|) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-11-12 00:58:04,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:58:04,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:58:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-12 00:58:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366592621] [2023-11-12 00:58:04,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:58:04,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:58:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:58:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:58:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=395, Unknown=1, NotChecked=0, Total=462 [2023-11-12 00:58:04,223 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:58:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:58:04,327 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-11-12 00:58:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:58:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 28 [2023-11-12 00:58:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:58:04,328 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:58:04,328 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:58:04,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2023-11-12 00:58:04,330 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:58:04,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:58:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:58:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:58:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:58:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 00:58:04,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2023-11-12 00:58:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:58:04,338 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 00:58:04,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:58:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 00:58:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:58:04,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:58:04,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:58:04,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:58:04,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:04,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:58:04,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:58:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 139383584, now seen corresponding path program 5 times [2023-11-12 00:58:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:58:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779365228] [2023-11-12 00:58:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:58:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:58:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:58:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-12 00:58:04,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:58:04,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779365228] [2023-11-12 00:58:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779365228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:58:04,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902977533] [2023-11-12 00:58:04,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:58:04,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:04,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:58:04,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:58:04,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:58:04,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 00:58:04,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:58:04,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:58:04,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:58:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:58:04,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:58:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902977533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:58:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:58:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-12 00:58:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374378919] [2023-11-12 00:58:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:58:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:58:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:58:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:58:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:58:04,969 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:58:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:58:04,993 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-11-12 00:58:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:58:04,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 30 [2023-11-12 00:58:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:58:04,995 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:58:04,995 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:58:04,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:58:04,996 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:58:04,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:58:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:58:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:58:04,997 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:58:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:58:04,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-11-12 00:58:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:58:04,998 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:58:04,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:58:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:58:04,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:58:05,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 00:58:05,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 00:58:05,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:58:05,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:58:05,811 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (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|)) [2023-11-12 00:58:05,811 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-11-12 00:58:05,811 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-11-12 00:58:05,811 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse0 (= (select (select |#memory_int| .cse6) 8) 3)) (.cse5 (not (= .cse6 |ULTIMATE.start_main_~s~0#1.base|))) (.cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse2 (not (= .cse6 0))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse5 .cse1 .cse2 .cse3 .cse4)))) [2023-11-12 00:58:05,811 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:58:05,811 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-11-12 00:58:05,812 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-11-12 00:58:05,812 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse1 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (and (= (select (select |#memory_int| .cse0) 8) 3) .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) (not (= .cse0 0)) .cse2 .cse3)) (and (<= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3))) [2023-11-12 00:58:05,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2023-11-12 00:58:05,812 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-11-12 00:58:05,812 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-12 00:58:05,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:58:05,812 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse2 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse9 (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse10 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (not (= .cse1 |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse5 (not (= .cse1 0))) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= (select (select |#memory_int| .cse1) 8) 3) (= |ULTIMATE.start_main_~i~0#1| 0) .cse2 .cse3 .cse4 .cse5 (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse2 .cse10 (= .cse1 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse4 .cse5 (not .cse7) .cse6 .cse8) (and .cse0 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 1) .cse9 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2023-11-12 00:58:05,812 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-11-12 00:58:05,812 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-11-12 00:58:05,813 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 626 645) no Hoare annotation was computed. [2023-11-12 00:58:05,813 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (not .cse2)) (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) .cse2))) [2023-11-12 00:58:05,813 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 8)) (.cse2 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse1 (= (select (select |#memory_int| .cse12) 8) 3)) (.cse3 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse6 (not (= .cse12 0))) (.cse7 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= 3 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| 0))) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 .cse0) .cse2 .cse3 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse8 .cse9 .cse10) (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 0))) (and .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 0) 0) .cse3 .cse4 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (not (= .cse11 0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| .cse11)) (= 3 (select (select |#memory_int| .cse11) 8)) .cse10))))) [2023-11-12 00:58:05,813 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-11-12 00:58:05,813 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-11-12 00:58:05,813 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-11-12 00:58:05,813 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-11-12 00:58:05,817 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1] [2023-11-12 00:58:05,819 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:58:05,833 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,836 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,836 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,837 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,838 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,838 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,838 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,838 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,839 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,839 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,839 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,839 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,839 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,840 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,840 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,840 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,840 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,840 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,841 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,841 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,841 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,841 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,841 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,849 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,850 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,850 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,850 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,850 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,852 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,852 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,852 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,853 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,853 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,853 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,853 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,853 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,854 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,854 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,854 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,854 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,855 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,855 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,855 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,855 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,855 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,856 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:05,863 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,863 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,863 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,863 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,864 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,868 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,868 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,868 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,868 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,869 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,871 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,871 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,871 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,872 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,872 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,872 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,872 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,872 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,873 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,878 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,879 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,881 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,882 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,883 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,883 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,883 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,883 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,883 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,892 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated [2023-11-12 00:58:05,893 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated [2023-11-12 00:58:05,893 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~last~0!base] could not be translated [2023-11-12 00:58:05,894 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated [2023-11-12 00:58:05,896 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated [2023-11-12 00:58:05,897 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~last~0!base] could not be translated [2023-11-12 00:58:05,898 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:05,899 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,899 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,901 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,902 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,902 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,902 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:05,902 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,903 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,903 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,903 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,903 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:05,904 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,904 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:05,904 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,905 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,905 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,906 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-11-12 00:58:05,906 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,906 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,906 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:05,907 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,907 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,907 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:05,907 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,907 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,908 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,908 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:05,908 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated [2023-11-12 00:58:05,909 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:05,910 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,910 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,910 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,910 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,910 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,912 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:05,912 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,913 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,913 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,913 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,913 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:05,913 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:05,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:05,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-11-12 00:58:05,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:05,915 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:05,915 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:05,915 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:05,915 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:05,915 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:05,916 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:05,916 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,916 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:05,916 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:05,916 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated [2023-11-12 00:58:05,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:58:05 BoogieIcfgContainer [2023-11-12 00:58:05,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:58:05,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:58:05,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:58:05,918 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:58:05,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:34" (3/4) ... [2023-11-12 00:58:05,920 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:58:05,925 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-12 00:58:05,933 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2023-11-12 00:58:05,934 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-12 00:58:05,934 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 00:58:05,935 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:58:06,063 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:58:06,063 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:58:06,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:58:06,064 INFO L158 Benchmark]: Toolchain (without parser) took 32413.94ms. Allocated memory was 144.7MB in the beginning and 474.0MB in the end (delta: 329.3MB). Free memory was 113.4MB in the beginning and 343.8MB in the end (delta: -230.4MB). Peak memory consumption was 100.0MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,065 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 111.1MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:58:06,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.91ms. Allocated memory is still 144.7MB. Free memory was 113.4MB in the beginning and 95.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.03ms. Allocated memory is still 144.7MB. Free memory was 95.7MB in the beginning and 93.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,066 INFO L158 Benchmark]: Boogie Preprocessor took 37.67ms. Allocated memory is still 144.7MB. Free memory was 93.6MB in the beginning and 91.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,067 INFO L158 Benchmark]: RCFGBuilder took 563.47ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 69.6MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,067 INFO L158 Benchmark]: TraceAbstraction took 30966.23ms. Allocated memory was 144.7MB in the beginning and 474.0MB in the end (delta: 329.3MB). Free memory was 69.2MB in the beginning and 349.1MB in the end (delta: -279.9MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,067 INFO L158 Benchmark]: Witness Printer took 146.34ms. Allocated memory is still 474.0MB. Free memory was 349.1MB in the beginning and 343.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:58:06,073 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.31ms. Allocated memory is still 111.1MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.91ms. Allocated memory is still 144.7MB. Free memory was 113.4MB in the beginning and 95.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.03ms. Allocated memory is still 144.7MB. Free memory was 95.7MB in the beginning and 93.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.67ms. Allocated memory is still 144.7MB. Free memory was 93.6MB in the beginning and 91.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.47ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 69.6MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30966.23ms. Allocated memory was 144.7MB in the beginning and 474.0MB in the end (delta: 329.3MB). Free memory was 69.2MB in the beginning and 349.1MB in the end (delta: -279.9MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Witness Printer took 146.34ms. Allocated memory is still 474.0MB. Free memory was 349.1MB in the beginning and 343.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~last~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~last~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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 ~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: ArrayAccessExpression #memory_int[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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 ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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 ~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: ArrayAccessExpression #memory_int[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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 ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 369 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 265 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1407 IncrementalHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 135 mSDtfsCounter, 1407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 316 SyntacticMatches, 11 SemanticMatches, 220 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 26 NumberOfFragments, 600 HoareAnnotationTreeSize, 11 FomulaSimplifications, 1872 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 113 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 458 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 559 ConstructedInterpolants, 9 QuantifiedInterpolants, 3052 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2223 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 219/294 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant [2023-11-12 00:58:06,106 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,106 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,106 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,107 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,107 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,107 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,107 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,107 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,108 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,108 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,108 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,108 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,108 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,109 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,109 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,109 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,110 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,110 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,110 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,110 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,111 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,111 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,111 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,111 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,111 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,111 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,112 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,112 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,115 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,116 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,116 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,116 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,116 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,116 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,117 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,118 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,118 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,118 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,118 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,118 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,118 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,119 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,119 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,120 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,120 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,120 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-12 00:58:06,120 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,120 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,120 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,121 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,121 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 Derived loop invariant: ((((index == 0) && (2 == data)) || ((3 == data) && (index == 0))) || ((index == 1) && (3 == data))) - InvariantResult [Line: 635]: Loop Invariant [2023-11-12 00:58:06,122 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,122 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,122 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,122 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,123 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,125 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated Derived loop invariant: (((i == 1) && (len == 2)) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 631]: Loop Invariant [2023-11-12 00:58:06,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,130 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,130 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,132 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,132 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,132 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,132 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,132 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated Derived loop invariant: ((((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2023-11-12 00:58:06,134 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated [2023-11-12 00:58:06,136 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated [2023-11-12 00:58:06,136 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~last~0!base] could not be translated [2023-11-12 00:58:06,140 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated [2023-11-12 00:58:06,140 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated [2023-11-12 00:58:06,142 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~last~0!base] could not be translated Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 613]: Loop Invariant [2023-11-12 00:58:06,142 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,143 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:06,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,149 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,150 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:06,150 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated [2023-11-12 00:58:06,151 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:06,152 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,152 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,152 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,152 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,152 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,153 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:06,153 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,153 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,153 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,153 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,153 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-11-12 00:58:06,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:06,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-11-12 00:58:06,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-11-12 00:58:06,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-11-12 00:58:06,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-12 00:58:06,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:06,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-12 00:58:06,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-12 00:58:06,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-12 00:58:06,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-12 00:58:06,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:58:06,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-12 00:58:06,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated Derived loop invariant: (((index <= 0) || (index <= 0)) || (index == 1)) RESULT: Ultimate proved your program to be correct! [2023-11-12 00:58:06,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2390acf6-8732-434a-94e1-39f731a511d0/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