./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ --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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:01:35,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:01:35,440 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:01:35,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:01:35,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:01:35,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:01:35,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:01:35,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:01:35,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:01:35,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:01:35,491 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:01:35,491 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:01:35,492 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:01:35,493 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:01:35,493 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:01:35,494 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:01:35,495 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:01:35,495 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:01:35,496 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:01:35,497 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:01:35,497 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:01:35,498 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:01:35,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:01:35,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:01:35,500 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:01:35,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:01:35,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:01:35,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:01:35,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:01:35,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:01:35,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:01:35,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:01:35,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:01:35,506 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:01:35,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:01:35,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:01:35,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:35,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:01:35,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:01:35,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:01:35,525 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:01:35,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:01:35,526 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:01:35,526 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:01:35,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:01:35,527 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_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/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_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2023-11-19 05:01:35,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:01:35,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:01:35,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:01:35,896 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:01:35,897 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:01:35,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-11-19 05:01:39,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:01:39,653 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:01:39,654 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-11-19 05:01:39,683 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/data/71d15ae8d/7bd086b2e24e4b1f91f0c2c2c4fb9f4a/FLAGc04a1347f [2023-11-19 05:01:39,707 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/data/71d15ae8d/7bd086b2e24e4b1f91f0c2c2c4fb9f4a [2023-11-19 05:01:39,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:01:39,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:01:39,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:39,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:01:39,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:01:39,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:39" (1/1) ... [2023-11-19 05:01:39,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239bf542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:39, skipping insertion in model container [2023-11-19 05:01:39,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:39" (1/1) ... [2023-11-19 05:01:39,815 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:01:40,136 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_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2023-11-19 05:01:40,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:40,164 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:01:40,247 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_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2023-11-19 05:01:40,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:40,290 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:01:40,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40 WrapperNode [2023-11-19 05:01:40,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:40,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:40,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:01:40,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:01:40,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,379 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2023-11-19 05:01:40,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:40,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:01:40,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:01:40,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:01:40,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:01:40,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:01:40,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:01:40,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:01:40,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (1/1) ... [2023-11-19 05:01:40,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:40,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:01:40,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:01:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:01:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:01:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 05:01:40,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 05:01:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:01:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:01:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:01:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:01:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:01:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:01:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:01:40,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:01:40,734 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:01:40,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:01:40,976 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:01:41,070 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:01:41,077 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-19 05:01:41,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:41 BoogieIcfgContainer [2023-11-19 05:01:41,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:01:41,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:01:41,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:01:41,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:01:41,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:01:39" (1/3) ... [2023-11-19 05:01:41,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6268fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:41, skipping insertion in model container [2023-11-19 05:01:41,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:40" (2/3) ... [2023-11-19 05:01:41,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6268fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:41, skipping insertion in model container [2023-11-19 05:01:41,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:41" (3/3) ... [2023-11-19 05:01:41,091 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2023-11-19 05:01:41,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:01:41,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:01:41,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:01:41,165 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;@4915b532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:01:41,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:01:41,169 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-19 05:01:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:01:41,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:41,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:41,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:41,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1591037076, now seen corresponding path program 1 times [2023-11-19 05:01:41,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:41,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209738737] [2023-11-19 05:01:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:41,683 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-19 05:01:41,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209738737] [2023-11-19 05:01:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209738737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:41,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:01:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713110436] [2023-11-19 05:01:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:41,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:01:41,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:01:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:01:41,743 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-19 05:01:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:41,816 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2023-11-19 05:01:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:01:41,819 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-19 05:01:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:41,828 INFO L225 Difference]: With dead ends: 37 [2023-11-19 05:01:41,828 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 05:01:41,831 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-19 05:01:41,835 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:41,836 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.0s Time] [2023-11-19 05:01:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 05:01:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-11-19 05:01:41,875 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-19 05:01:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-11-19 05:01:41,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2023-11-19 05:01:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:41,879 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-11-19 05:01:41,879 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-19 05:01:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-19 05:01:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 05:01:41,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:41,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:41,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:01:41,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:41,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1328846498, now seen corresponding path program 1 times [2023-11-19 05:01:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875469613] [2023-11-19 05:01:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:42,147 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-19 05:01:42,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875469613] [2023-11-19 05:01:42,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875469613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:42,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:01:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445330434] [2023-11-19 05:01:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:42,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:01:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:01:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:01:42,152 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-19 05:01:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:42,225 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-11-19 05:01:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:01:42,226 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-19 05:01:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:42,227 INFO L225 Difference]: With dead ends: 29 [2023-11-19 05:01:42,227 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 05:01:42,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:01:42,230 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 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-19 05:01:42,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:01:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 05:01:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-11-19 05:01:42,238 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-19 05:01:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-11-19 05:01:42,239 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2023-11-19 05:01:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:42,240 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-11-19 05:01:42,262 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-19 05:01:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-11-19 05:01:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:01:42,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:42,263 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-19 05:01:42,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:01:42,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:42,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2002600429, now seen corresponding path program 1 times [2023-11-19 05:01:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614539190] [2023-11-19 05:01:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:42,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614539190] [2023-11-19 05:01:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614539190] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012845092] [2023-11-19 05:01:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:42,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:42,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:42,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:01:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:42,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 05:01:42,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:42,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012845092] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1471887732] [2023-11-19 05:01:42,987 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:01:42,987 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:42,995 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:43,002 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:43,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:44,822 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:01:44,881 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1471887732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:46,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:46,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 5, 5] total 20 [2023-11-19 05:01:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37971660] [2023-11-19 05:01:46,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:46,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:01:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:01:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-11-19 05:01:46,521 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-19 05:01:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:47,938 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2023-11-19 05:01:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:01:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-19 05:01:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:47,940 INFO L225 Difference]: With dead ends: 27 [2023-11-19 05:01:47,940 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 05:01:47,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-11-19 05:01:47,942 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:47,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 05:01:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 05:01:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-11-19 05:01:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:01:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2023-11-19 05:01:47,952 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 20 [2023-11-19 05:01:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:47,953 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-11-19 05:01:47,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-19 05:01:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2023-11-19 05:01:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:01:47,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:47,955 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-19 05:01:47,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:48,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:48,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:48,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -135389111, now seen corresponding path program 1 times [2023-11-19 05:01:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063763387] [2023-11-19 05:01:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:48,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063763387] [2023-11-19 05:01:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063763387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:01:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063059559] [2023-11-19 05:01:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:48,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:01:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:01:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:01:48,307 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-19 05:01:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:48,351 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-11-19 05:01:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:01:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 21 [2023-11-19 05:01:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:48,353 INFO L225 Difference]: With dead ends: 33 [2023-11-19 05:01:48,353 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 05:01:48,353 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-19 05:01:48,354 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:48,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:01:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 05:01:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2023-11-19 05:01:48,364 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-19 05:01:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-11-19 05:01:48,365 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 21 [2023-11-19 05:01:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:48,365 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-19 05:01:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-19 05:01:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-11-19 05:01:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:01:48,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:48,367 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-19 05:01:48,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:01:48,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:48,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1104262822, now seen corresponding path program 2 times [2023-11-19 05:01:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301082445] [2023-11-19 05:01:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:49,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301082445] [2023-11-19 05:01:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301082445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512882024] [2023-11-19 05:01:49,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:01:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:49,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:49,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:49,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:01:49,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 05:01:49,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:01:49,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-19 05:01:49,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:01:50,159 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:01:50,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:01:50,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:01:50,273 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 05:01:50,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-19 05:01:50,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-19 05:01:50,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:01:50,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-19 05:01:50,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:01:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:01:50,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:51,024 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_285) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2023-11-19 05:01:51,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:01:51,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-11-19 05:01:51,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:01:51,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2023-11-19 05:01:51,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-11-19 05:01:51,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:01:51,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-11-19 05:01:51,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-19 05:01:51,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-19 05:01:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 05:01:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512882024] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [188570957] [2023-11-19 05:01:51,939 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:01:51,940 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:51,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:51,940 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:51,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:52,850 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:01:52,897 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:54,864 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '671#(and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))' at error location [2023-11-19 05:01:54,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:01:54,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 52 [2023-11-19 05:01:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462153349] [2023-11-19 05:01:54,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:54,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-19 05:01:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:54,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-19 05:01:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3646, Unknown=24, NotChecked=122, Total=4032 [2023-11-19 05:01:54,876 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:01:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:55,951 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-11-19 05:01:55,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 05:01:55,952 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2023-11-19 05:01:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:55,954 INFO L225 Difference]: With dead ends: 47 [2023-11-19 05:01:55,955 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 05:01:55,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=348, Invalid=4602, Unknown=24, NotChecked=138, Total=5112 [2023-11-19 05:01:55,958 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 119 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:55,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 260 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 625 Invalid, 0 Unknown, 50 Unchecked, 0.6s Time] [2023-11-19 05:01:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 05:01:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2023-11-19 05:01:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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-19 05:01:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2023-11-19 05:01:55,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 23 [2023-11-19 05:01:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:55,975 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2023-11-19 05:01:55,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 44 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:01:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2023-11-19 05:01:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:01:55,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:55,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:56,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:56,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:56,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:56,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1958869380, now seen corresponding path program 3 times [2023-11-19 05:01:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681662160] [2023-11-19 05:01:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:56,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681662160] [2023-11-19 05:01:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681662160] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109118701] [2023-11-19 05:01:56,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:01:56,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:56,351 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:56,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:01:56,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:01:56,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:01:56,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 05:01:56,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:56,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:01:56,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109118701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:56,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873594191] [2023-11-19 05:01:56,570 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:01:56,571 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:56,571 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:56,571 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:56,571 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:01:57,453 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:01:57,488 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:01:58,413 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '980#(and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))' at error location [2023-11-19 05:01:58,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:01:58,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:58,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-19 05:01:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131148937] [2023-11-19 05:01:58,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:58,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:01:58,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:58,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:01:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-11-19 05:01:58,417 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:58,520 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2023-11-19 05:01:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:01:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-19 05:01:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:58,522 INFO L225 Difference]: With dead ends: 53 [2023-11-19 05:01:58,522 INFO L226 Difference]: Without dead ends: 46 [2023-11-19 05:01:58,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-11-19 05:01:58,523 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:58,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 45 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-19 05:01:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2023-11-19 05:01:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 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-19 05:01:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2023-11-19 05:01:58,541 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 24 [2023-11-19 05:01:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:58,541 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2023-11-19 05:01:58,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2023-11-19 05:01:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:01:58,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:58,543 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-19 05:01:58,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:58,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 05:01:58,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:58,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash 125303843, now seen corresponding path program 1 times [2023-11-19 05:01:58,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:58,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714908683] [2023-11-19 05:01:58,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:01:58,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714908683] [2023-11-19 05:01:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714908683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:01:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324305832] [2023-11-19 05:01:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:58,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:01:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:01:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:01:58,872 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:58,935 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2023-11-19 05:01:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:01:58,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-11-19 05:01:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:58,942 INFO L225 Difference]: With dead ends: 46 [2023-11-19 05:01:58,942 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 05:01:58,942 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-19 05:01:58,944 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:58,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:01:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 05:01:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2023-11-19 05:01:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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-19 05:01:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2023-11-19 05:01:58,965 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 24 [2023-11-19 05:01:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:58,966 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2023-11-19 05:01:58,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:01:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2023-11-19 05:01:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 05:01:58,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:58,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:58,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:01:58,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:58,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1215819031, now seen corresponding path program 4 times [2023-11-19 05:01:58,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:58,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141463408] [2023-11-19 05:01:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:01:59,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141463408] [2023-11-19 05:01:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141463408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184317294] [2023-11-19 05:01:59,096 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 05:01:59,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:59,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:59,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:59,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:01:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:59,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 05:01:59,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:01:59,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:01:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184317294] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1043324213] [2023-11-19 05:01:59,325 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:01:59,325 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:59,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:01:59,326 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:01:59,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:00,177 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:02:00,213 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:02:01,224 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1448#(and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))' at error location [2023-11-19 05:02:01,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:02:01,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:02:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-19 05:02:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122775108] [2023-11-19 05:02:01,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:02:01,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 05:02:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:01,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 05:02:01,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2023-11-19 05:02:01,226 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-19 05:02:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:01,331 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-11-19 05:02:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:02:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-19 05:02:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:01,335 INFO L225 Difference]: With dead ends: 57 [2023-11-19 05:02:01,335 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 05:02:01,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2023-11-19 05:02:01,338 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:01,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 73 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:02:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 05:02:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-11-19 05:02:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-19 05:02:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-19 05:02:01,366 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2023-11-19 05:02:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:01,367 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-19 05:02:01,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-19 05:02:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-19 05:02:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 05:02:01,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:01,368 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] [2023-11-19 05:02:01,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:01,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:01,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:02:01,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1890627204, now seen corresponding path program 1 times [2023-11-19 05:02:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215785596] [2023-11-19 05:02:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:02:01,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215785596] [2023-11-19 05:02:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215785596] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381763469] [2023-11-19 05:02:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:01,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:01,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 05:02:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:01,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:02:01,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:02:01,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:02:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:02:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381763469] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:02:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610286586] [2023-11-19 05:02:01,885 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:02:01,885 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:02:01,886 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:02:01,886 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:02:01,886 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:02,857 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:02:02,892 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:02:04,006 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1776#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2023-11-19 05:02:04,006 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:02:04,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:02:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-19 05:02:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128663691] [2023-11-19 05:02:04,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:02:04,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:02:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:02:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2023-11-19 05:02:04,009 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-19 05:02:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:04,092 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-11-19 05:02:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:02:04,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-11-19 05:02:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:04,093 INFO L225 Difference]: With dead ends: 42 [2023-11-19 05:02:04,093 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:02:04,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2023-11-19 05:02:04,097 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:04,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:02:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:02:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-11-19 05:02:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-19 05:02:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-19 05:02:04,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2023-11-19 05:02:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:04,124 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-19 05:02:04,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-19 05:02:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-19 05:02:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 05:02:04,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:04,127 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-19 05:02:04,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:04,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:04,343 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:02:04,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1517811777, now seen corresponding path program 1 times [2023-11-19 05:02:04,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:04,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613914952] [2023-11-19 05:02:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:02:06,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:06,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613914952] [2023-11-19 05:02:06,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613914952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638131908] [2023-11-19 05:02:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:06,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:06,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:06,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:06,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 05:02:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:06,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-19 05:02:06,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:06,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:02:06,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:02:06,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-19 05:02:06,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:02:06,549 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 05:02:06,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-19 05:02:06,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:02:06,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-19 05:02:06,858 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 05:02:06,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2023-11-19 05:02:06,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-19 05:02:06,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-19 05:02:07,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-19 05:02:07,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-19 05:02:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:02:07,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:02:07,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2023-11-19 05:02:07,463 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_738 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_738) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_740 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2023-11-19 05:02:07,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:02:07,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-11-19 05:02:07,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-11-19 05:02:07,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_85| Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_85| 4) v_ArrVal_736) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_85| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2023-11-19 05:02:07,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:02:07,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-19 05:02:07,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-11-19 05:02:07,851 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:02:07,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-19 05:02:07,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 05:02:07,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-11-19 05:02:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-19 05:02:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638131908] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:02:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1577339158] [2023-11-19 05:02:08,413 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:02:08,413 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:02:08,414 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:02:08,414 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:02:08,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:09,443 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:02:09,476 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:02:12,019 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2137#(and (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_41| Int) (|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_41| Int)) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_41|) (+ 4 |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_41|)))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2023-11-19 05:02:12,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:02:12,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:02:12,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 58 [2023-11-19 05:02:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423466063] [2023-11-19 05:02:12,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:02:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-19 05:02:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:12,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-19 05:02:12,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=4592, Unknown=2, NotChecked=274, Total=5112 [2023-11-19 05:02:12,024 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 58 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 50 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:02:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:13,841 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-19 05:02:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 05:02:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 50 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-11-19 05:02:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:13,842 INFO L225 Difference]: With dead ends: 48 [2023-11-19 05:02:13,842 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 05:02:13,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=421, Invalid=7067, Unknown=2, NotChecked=342, Total=7832 [2023-11-19 05:02:13,846 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:13,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 242 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 748 Invalid, 0 Unknown, 82 Unchecked, 0.7s Time] [2023-11-19 05:02:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 05:02:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2023-11-19 05:02:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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-19 05:02:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-11-19 05:02:13,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2023-11-19 05:02:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:13,863 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-11-19 05:02:13,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 50 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 05:02:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-11-19 05:02:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 05:02:13,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:13,864 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-19 05:02:13,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:14,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:14,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:02:14,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -194762212, now seen corresponding path program 2 times [2023-11-19 05:02:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:14,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050521084] [2023-11-19 05:02:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:02:14,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050521084] [2023-11-19 05:02:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050521084] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871521157] [2023-11-19 05:02:14,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:02:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:14,188 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:14,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 05:02:14,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 05:02:14,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:02:14,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 05:02:14,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:14,413 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-19 05:02:14,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:02:14,455 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-19 05:02:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871521157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:02:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1837271574] [2023-11-19 05:02:14,465 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:02:14,465 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:02:14,465 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:02:14,466 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:02:14,466 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:02:15,429 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-11-19 05:02:15,464 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:02:16,588 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2501#(and (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_54| Int)) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_54|) (+ 4 |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_54|)))) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2023-11-19 05:02:16,588 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:02:16,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:02:16,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-19 05:02:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175338514] [2023-11-19 05:02:16,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:02:16,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:02:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:02:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-11-19 05:02:16,592 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-19 05:02:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:16,720 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-11-19 05:02:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:02:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-19 05:02:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:16,721 INFO L225 Difference]: With dead ends: 46 [2023-11-19 05:02:16,721 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 05:02:16,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2023-11-19 05:02:16,722 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:16,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:02:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 05:02:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-11-19 05:02:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-19 05:02:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-11-19 05:02:16,733 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 28 [2023-11-19 05:02:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:16,733 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-19 05:02:16,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-19 05:02:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-11-19 05:02:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 05:02:16,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:02:16,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:02:16,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:16,941 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:02:16,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:02:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1972844504, now seen corresponding path program 5 times [2023-11-19 05:02:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:02:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140305391] [2023-11-19 05:02:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:02:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:02:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:02:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 05:02:17,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:02:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140305391] [2023-11-19 05:02:17,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140305391] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:02:17,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326852754] [2023-11-19 05:02:17,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:02:17,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:02:17,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:02:17,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:02:17,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-19 05:02:17,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 05:02:17,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:02:17,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:02:17,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:02:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 05:02:17,247 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:02:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326852754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:02:17,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:02:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-19 05:02:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938180089] [2023-11-19 05:02:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:02:17,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:02:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:02:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:02:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:02:17,250 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-19 05:02:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:02:17,267 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2023-11-19 05:02:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:02:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2023-11-19 05:02:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:02:17,268 INFO L225 Difference]: With dead ends: 31 [2023-11-19 05:02:17,268 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 05:02:17,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-19 05:02:17,270 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:02:17,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:02:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 05:02:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 05:02:17,271 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-19 05:02:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 05:02:17,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2023-11-19 05:02:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:02:17,272 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 05:02:17,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-19 05:02:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 05:02:17,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 05:02:17,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 05:02:17,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-19 05:02:17,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-19 05:02:17,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 05:02:27,503 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 620 639) no Hoare annotation was computed. [2023-11-19 05:02:27,504 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse15 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (= (select .cse17 0) 0)) (.cse7 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse8 (<= 1 |#StackHeapBarrier|)) (.cse0 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse9 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse10 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse11 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse5 (select .cse15 0)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse4 (= .cse5 |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse6) (and (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 2) .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse9 .cse10 .cse11 .cse3 (exists ((|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0))) (= |#memory_int| (store |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))))) .cse12 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse4 .cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse6) (and .cse7 .cse8 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) 0) .cse9 .cse10 .cse11 .cse1 (exists ((|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (let ((.cse14 (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (store .cse14 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse14 |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse15 4))))) (= |#memory_int| (store |v_#memory_int_77| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_77| |ULTIMATE.start_main_~s~0#1.base|) 4 2))) (= |v_#memory_int_77| (store |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= |#memory_$Pointer$.offset| (let ((.cse16 (store |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)))) (store .cse16 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse16 |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse17 4))))))) .cse2 (not (= .cse5 |ULTIMATE.start_main_~s~0#1.base|)) (= 3 |ULTIMATE.start_main_~new_data~0#1|) .cse12 .cse4 .cse13 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse6 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1))))) [2023-11-19 05:02:27,504 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2023-11-19 05:02:27,504 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-11-19 05:02:27,504 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse1 (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (.cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (not (= .cse10 |ULTIMATE.start_main_~s~0#1.base|))) (.cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse4 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (= 3 (select (select |#memory_int| .cse10) 4))) (.cse8 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse0 (= (select .cse1 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse3 .cse5 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse8 .cse6 (= 2 (select .cse1 4)) (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse7) (let ((.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0))) (and (not (= .cse9 |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse0 (= 3 (select (select |#memory_int| .cse9) 4)) .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0) 0) .cse7))))) [2023-11-19 05:02:27,504 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 05:02:27,505 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse12 (select .cse9 0))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (not (= .cse12 |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse6 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (= (select .cse11 0) 0)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 (exists ((|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0))) (= |#memory_int| (store |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))))) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|v_#memory_int_76| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_60| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (let ((.cse8 (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (store .cse8 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse9 4))))) (= |#memory_int| (store |v_#memory_int_77| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_77| |ULTIMATE.start_main_~s~0#1.base|) 4 2))) (= |v_#memory_int_77| (store |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_77| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= |#memory_$Pointer$.offset| (let ((.cse10 (store |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)))) (store .cse10 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse11 4))))))) .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse7) (and .cse3 (= 3 (select (select |#memory_int| .cse12) 4)) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5 (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse7))))) [2023-11-19 05:02:27,505 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select .cse0 1) 0) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) [2023-11-19 05:02:27,505 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-11-19 05:02:27,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2023-11-19 05:02:27,506 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse8 (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) (or (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse4 .cse5 .cse6 (not .cse7) .cse8) (let ((.cse9 (select |#memory_int| 1))) (and .cse0 (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse1 .cse2 .cse3 (= 2 (select |#length| 1)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse4 .cse7 (= (select |#valid| 0) 0) .cse5 (= (select |#valid| 2) 1) (= (select .cse9 0) 48) .cse6 (= (select .cse9 1) 0) .cse8)))) [2023-11-19 05:02:27,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 05:02:27,506 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-11-19 05:02:27,506 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1)) [2023-11-19 05:02:27,506 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-11-19 05:02:27,506 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 620 639) no Hoare annotation was computed. [2023-11-19 05:02:27,506 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-11-19 05:02:27,507 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse2 (= 3 (select (select |#memory_int| .cse0) 4))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 1) (not (= .cse0 |ULTIMATE.start_main_~s~0#1.base|)) .cse1 .cse2 .cse3 .cse4) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse4)))) [2023-11-19 05:02:27,507 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-19 05:02:27,507 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-11-19 05:02:27,507 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (or (not (= |node_create_#in~data#1| 1)) (< |#StackHeapBarrier| 1) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2023-11-19 05:02:27,507 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-11-19 05:02:27,511 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2023-11-19 05:02:27,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:02:27,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated [2023-11-19 05:02:27,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated [2023-11-19 05:02:27,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-11-19 05:02:27,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 05:02:27,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-11-19 05:02:27,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-11-19 05:02:27,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-11-19 05:02:27,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-11-19 05:02:27,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-19 05:02:27,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-19 05:02:27,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated [2023-11-19 05:02:27,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated [2023-11-19 05:02:27,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated [2023-11-19 05:02:27,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 05:02:27,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 05:02:27,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated [2023-11-19 05:02:27,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 05:02:27,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: (v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]] == #memory_$Pointer$.base && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]]) && #memory_int == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) could not be translated [2023-11-19 05:02:27,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 05:02:27,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-19 05:02:27,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-19 05:02:27,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-11-19 05:02:27,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 05:02:27,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_#memory_int_77 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: ((#memory_$Pointer$.base == v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] && #memory_int == v_#memory_int_77[~s~0!base := v_#memory_int_77[~s~0!base][4 := 2]]) && v_#memory_int_77 == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := v_#memory_int_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) could not be translated [2023-11-19 05:02:27,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-11-19 05:02:27,551 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 05:02:27,551 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,551 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,553 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: (v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]] == #memory_$Pointer$.base && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]]) && #memory_int == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) could not be translated [2023-11-19 05:02:27,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_#memory_int_77 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: ((#memory_$Pointer$.base == v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] && #memory_int == v_#memory_int_77[~s~0!base := v_#memory_int_77[~s~0!base][4 := 2]]) && v_#memory_int_77 == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := v_#memory_int_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) could not be translated [2023-11-19 05:02:27,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,556 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,556 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,556 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated [2023-11-19 05:02:27,557 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated [2023-11-19 05:02:27,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 05:02:27,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset + 4] could not be translated [2023-11-19 05:02:27,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-19 05:02:27,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated [2023-11-19 05:02:27,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 05:02:27,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 05:02:27,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-19 05:02:27,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated [2023-11-19 05:02:27,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 05:02:27,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][4] could not be translated [2023-11-19 05:02:27,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated [2023-11-19 05:02:27,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-11-19 05:02:27,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-11-19 05:02:27,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][4] could not be translated [2023-11-19 05:02:27,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-11-19 05:02:27,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-11-19 05:02:27,563 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-11-19 05:02:27,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-11-19 05:02:27,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated [2023-11-19 05:02:27,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 05:02:27,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-19 05:02:27,564 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-11-19 05:02:27,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:02:27 BoogieIcfgContainer [2023-11-19 05:02:27,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:02:27,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:02:27,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:02:27,566 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:02:27,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:41" (3/4) ... [2023-11-19 05:02:27,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 05:02:27,573 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-19 05:02:27,580 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-11-19 05:02:27,581 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-19 05:02:27,581 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 05:02:27,582 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 05:02:27,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (len <= 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) [2023-11-19 05:02:27,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((3 == data) && (index <= 0)) || (((((\old(data) == 2) && (2 == data)) && (data == 1)) && (\old(index) == 0)) && (index == 0))) || (((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 1)) && (\old(index) == 1))) [2023-11-19 05:02:27,640 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (len <= 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) [2023-11-19 05:02:27,644 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((3 == data) && (index <= 0)) || (((((\old(data) == 2) && (2 == data)) && (data == 1)) && (\old(index) == 0)) && (index == 0))) || (((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 1)) && (\old(index) == 1))) [2023-11-19 05:02:27,706 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 05:02:27,707 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/witness.yml [2023-11-19 05:02:27,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:02:27,709 INFO L158 Benchmark]: Toolchain (without parser) took 47988.82ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 129.8MB in the beginning and 416.7MB in the end (delta: -286.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,709 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:02:27,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.91ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 112.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.21ms. Allocated memory is still 163.6MB. Free memory was 112.3MB in the beginning and 110.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,711 INFO L158 Benchmark]: Boogie Preprocessor took 64.57ms. Allocated memory is still 163.6MB. Free memory was 110.2MB in the beginning and 108.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,711 INFO L158 Benchmark]: RCFGBuilder took 636.86ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 113.8MB in the end (delta: -5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,712 INFO L158 Benchmark]: TraceAbstraction took 46480.62ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 113.1MB in the beginning and 421.9MB in the end (delta: -308.9MB). Peak memory consumption was 282.8MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,713 INFO L158 Benchmark]: Witness Printer took 141.80ms. Allocated memory is still 497.0MB. Free memory was 421.9MB in the beginning and 416.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 05:02:27,720 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.35ms. Allocated memory is still 123.7MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.91ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 112.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.21ms. Allocated memory is still 163.6MB. Free memory was 112.3MB in the beginning and 110.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.57ms. Allocated memory is still 163.6MB. Free memory was 110.2MB in the beginning and 108.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.86ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 113.8MB in the end (delta: -5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 46480.62ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 113.1MB in the beginning and 421.9MB in the end (delta: -308.9MB). Peak memory consumption was 282.8MB. Max. memory is 16.1GB. * Witness Printer took 141.80ms. Allocated memory is still 497.0MB. Free memory was 421.9MB in the beginning and 416.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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 #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] 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_int[#memory_$Pointer$.base[~s~0!base][0]][4] 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_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~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: 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[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: (v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]] == #memory_$Pointer$.base && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]]) && #memory_int == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!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 ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_#memory_int_77 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: ((#memory_$Pointer$.base == v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] && #memory_int == v_#memory_int_77[~s~0!base := v_#memory_int_77[~s~0!base][4 := 2]]) && v_#memory_int_77 == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := v_#memory_int_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) 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 ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - 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: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: (v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]] == #memory_$Pointer$.base && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]]) && #memory_int == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_76 : [int,int]int, v_#memory_$Pointer$.base_60 : [int,int]int, v_#memory_int_77 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 : int, v_#memory_$Pointer$.offset_60 : [int,int]int :: ((#memory_$Pointer$.base == v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.base_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] && #memory_int == v_#memory_int_77[~s~0!base := v_#memory_int_77[~s~0!base][4 := 2]]) && v_#memory_int_77 == v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_int_76[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := v_#memory_int_77[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0]]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16 := v_#memory_$Pointer$.offset_60[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) 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: Expression #res!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_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset + 4] 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 ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~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_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!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 ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][4] 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 ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] 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: 637]: 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: 46.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 879 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 132 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 134 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 380 SyntacticMatches, 13 SemanticMatches, 275 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3259 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=10, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 1041 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2571 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 132 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 479 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 625 ConstructedInterpolants, 15 QuantifiedInterpolants, 2758 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2321 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 227/331 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 1.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 12, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 18, TOOLS_POST_TIME: 0.6s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 36, TOOLS_QUANTIFIERELIM_TIME: 1.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 53, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 12, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 0.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 153, DAG_COMPRESSION_RETAINED_NODES: 52, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((((((\old(data) == 1) && (len <= 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((i == 1) && (len == 2)) || ((2 <= i) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((((3 == data) && (index <= 0)) || (((((\old(data) == 2) && (2 == data)) && (data == 1)) && (\old(index) == 0)) && (index == 0))) || (((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 1)) && (\old(index) == 1))) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((((i == 0) && (data == 1)) && (len == 2)) || ((((i == 1) && (data == 1)) && (len == 2)) && (2 == new_data))) || ((2 <= i) && (len == 2))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((index <= 0) || (index == 0)) || (index == 1)) RESULT: Ultimate proved your program to be correct! [2023-11-19 05:02:27,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a7143e5-2f83-4f82-8612-1cf1a4cf1041/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...