./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:13:15,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:13:15,555 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:13:15,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:13:15,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:13:15,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:13:15,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:13:15,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:13:15,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:13:15,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:13:15,585 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:13:15,585 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:13:15,586 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:13:15,586 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:13:15,587 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:13:15,587 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:13:15,587 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:13:15,588 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:13:15,588 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:13:15,589 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:13:15,589 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:13:15,590 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:13:15,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:13:15,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:13:15,591 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:13:15,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:13:15,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:13:15,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:13:15,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:13:15,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:13:15,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:13:15,594 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:13:15,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:13:15,594 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:13:15,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:13:15,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:13:15,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:13:15,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:13:15,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:13:15,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:13:15,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:13:15,596 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:13:15,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:13:15,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:13:15,597 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:13:15,597 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:13:15,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:13:15,597 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_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2023-12-02 15:13:15,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:13:15,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:13:15,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:13:15,844 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:13:15,845 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:13:15,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2023-12-02 15:13:18,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:13:18,822 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:13:18,823 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2023-12-02 15:13:18,836 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/data/71cf41a55/d9f171c285584d77b1c4d560ac11ffc5/FLAGe445a2200 [2023-12-02 15:13:18,847 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/data/71cf41a55/d9f171c285584d77b1c4d560ac11ffc5 [2023-12-02 15:13:18,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:13:18,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:13:18,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:13:18,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:13:18,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:13:18,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:13:18" (1/1) ... [2023-12-02 15:13:18,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5ca5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:18, skipping insertion in model container [2023-12-02 15:13:18,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:13:18" (1/1) ... [2023-12-02 15:13:18,903 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:13:19,149 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_9b5a09b6-1544-4567-8b72-70df10f84cab/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-12-02 15:13:19,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:13:19,162 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:13:19,202 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_9b5a09b6-1544-4567-8b72-70df10f84cab/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-12-02 15:13:19,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:13:19,229 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:13:19,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19 WrapperNode [2023-12-02 15:13:19,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:13:19,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:13:19,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:13:19,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:13:19,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,274 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 135 [2023-12-02 15:13:19,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:13:19,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:13:19,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:13:19,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:13:19,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:13:19,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:13:19,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:13:19,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:13:19,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (1/1) ... [2023-12-02 15:13:19,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:13:19,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:19,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:13:19,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:13:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 15:13:19,378 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 15:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:13:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:13:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:13:19,497 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:13:19,499 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:13:19,696 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:13:19,764 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:13:19,764 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 15:13:19,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:13:19 BoogieIcfgContainer [2023-12-02 15:13:19,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:13:19,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:13:19,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:13:19,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:13:19,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:13:18" (1/3) ... [2023-12-02 15:13:19,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428c7a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:13:19, skipping insertion in model container [2023-12-02 15:13:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:13:19" (2/3) ... [2023-12-02 15:13:19,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428c7a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:13:19, skipping insertion in model container [2023-12-02 15:13:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:13:19" (3/3) ... [2023-12-02 15:13:19,774 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2023-12-02 15:13:19,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:13:19,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:13:19,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:13:19,834 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;@1688d1e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:13:19,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:13:19,839 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-12-02 15:13:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:13:19,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:19,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:19,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:19,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -92566233, now seen corresponding path program 1 times [2023-12-02 15:13:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446414181] [2023-12-02 15:13:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:13:20,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446414181] [2023-12-02 15:13:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446414181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:13:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:13:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:13:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379738395] [2023-12-02 15:13:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:13:20,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:13:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:13:20,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:13:20,257 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-12-02 15:13:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:20,318 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2023-12-02 15:13:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:13:20,321 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-12-02 15:13:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:20,327 INFO L225 Difference]: With dead ends: 37 [2023-12-02 15:13:20,327 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 15:13:20,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:13:20,334 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-12-02 15:13:20,335 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-12-02 15:13:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 15:13:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-02 15:13:20,370 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-12-02 15:13:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-12-02 15:13:20,372 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2023-12-02 15:13:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:20,372 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-12-02 15:13:20,373 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-12-02 15:13:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-12-02 15:13:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 15:13:20,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:20,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:20,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:13:20,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:20,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1777268060, now seen corresponding path program 1 times [2023-12-02 15:13:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272351421] [2023-12-02 15:13:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:13:20,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272351421] [2023-12-02 15:13:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272351421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:13:20,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:13:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:13:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13402788] [2023-12-02 15:13:20,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:13:20,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:13:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:13:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:13:20,549 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-12-02 15:13:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:20,612 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-12-02 15:13:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:13:20,613 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-12-02 15:13:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:20,614 INFO L225 Difference]: With dead ends: 29 [2023-12-02 15:13:20,614 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 15:13:20,614 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-12-02 15:13:20,616 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:20,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:13:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 15:13:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-12-02 15:13:20,623 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-12-02 15:13:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-02 15:13:20,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2023-12-02 15:13:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:20,625 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-02 15:13:20,625 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-12-02 15:13:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-02 15:13:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 15:13:20,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:20,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:20,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:13:20,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:20,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1335505047, now seen corresponding path program 1 times [2023-12-02 15:13:20,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:20,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778236308] [2023-12-02 15:13:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:13:20,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778236308] [2023-12-02 15:13:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778236308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:13:20,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:13:20,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:13:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948929849] [2023-12-02 15:13:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:13:20,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:13:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:20,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:13:20,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:13:20,788 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:13:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:20,858 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2023-12-02 15:13:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:13:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-12-02 15:13:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:20,860 INFO L225 Difference]: With dead ends: 32 [2023-12-02 15:13:20,860 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 15:13:20,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:13:20,862 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:20,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:13:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 15:13:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-12-02 15:13:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:13:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-02 15:13:20,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20 [2023-12-02 15:13:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:20,870 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-02 15:13:20,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:13:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-02 15:13:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:13:20,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:20,872 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-12-02 15:13:20,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:13:20,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:20,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:20,873 INFO L85 PathProgramCache]: Analyzing trace with hash -172359502, now seen corresponding path program 1 times [2023-12-02 15:13:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:20,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633132202] [2023-12-02 15:13:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:13:20,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633132202] [2023-12-02 15:13:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633132202] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:20,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81443072] [2023-12-02 15:13:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:20,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:20,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:20,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:21,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:13:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:21,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:13:21,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:13:21,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:13:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81443072] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:21,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1598192169] [2023-12-02 15:13:21,294 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:21,294 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:21,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:21,302 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:21,303 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:23,067 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:23,076 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:24,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1598192169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:13:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:24,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 19 [2023-12-02 15:13:24,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828262437] [2023-12-02 15:13:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:13:24,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 15:13:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 15:13:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-12-02 15:13:24,141 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:13:25,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:13:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:25,777 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-12-02 15:13:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:13:25,777 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 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 21 [2023-12-02 15:13:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:25,778 INFO L225 Difference]: With dead ends: 31 [2023-12-02 15:13:25,778 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 15:13:25,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-12-02 15:13:25,779 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:25,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 30 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 15:13:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 15:13:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2023-12-02 15:13:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:13:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-02 15:13:25,785 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 21 [2023-12-02 15:13:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:25,786 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-02 15:13:25,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:13:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-02 15:13:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:13:25,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:25,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:25,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:13:25,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:25,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:25,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1050550792, now seen corresponding path program 1 times [2023-12-02 15:13:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:25,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202621066] [2023-12-02 15:13:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:26,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202621066] [2023-12-02 15:13:26,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202621066] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:26,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437227894] [2023-12-02 15:13:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:26,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:26,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:26,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:26,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:13:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:26,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:13:26,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:26,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:26,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437227894] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241507470] [2023-12-02 15:13:26,306 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:26,307 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:26,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:26,307 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:26,307 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:27,318 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:27,326 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:28,453 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '630#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2023-12-02 15:13:28,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:13:28,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-02 15:13:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265391693] [2023-12-02 15:13:28,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:13:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:13:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:13:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-12-02 15:13:28,455 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:13:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:28,522 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-12-02 15:13:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:13:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 22 [2023-12-02 15:13:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:28,523 INFO L225 Difference]: With dead ends: 35 [2023-12-02 15:13:28,523 INFO L226 Difference]: Without dead ends: 28 [2023-12-02 15:13:28,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-12-02 15:13:28,525 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:28,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:13:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-02 15:13:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2023-12-02 15:13:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:13:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-02 15:13:28,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 22 [2023-12-02 15:13:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:28,532 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-02 15:13:28,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:13:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-02 15:13:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:13:28,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:28,533 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-12-02 15:13:28,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:13:28,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:28,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:28,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1296477723, now seen corresponding path program 2 times [2023-12-02 15:13:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239246656] [2023-12-02 15:13:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:13:30,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239246656] [2023-12-02 15:13:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239246656] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337220097] [2023-12-02 15:13:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:13:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:30,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:30,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:13:30,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:13:30,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:13:30,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 15:13:30,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:30,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:13:31,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:13:31,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 15:13:31,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 15:13:31,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 15:13:31,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 15:13:31,105 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2023-12-02 15:13:31,106 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 32 [2023-12-02 15:13:31,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 15:13:31,275 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:13:31,276 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 74 treesize of output 65 [2023-12-02 15:13:31,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-02 15:13:31,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-12-02 15:13:31,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:13:31,405 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 37 treesize of output 21 [2023-12-02 15:13:31,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:13:31,412 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 53 treesize of output 29 [2023-12-02 15:13:31,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-12-02 15:13:31,544 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 41 treesize of output 25 [2023-12-02 15:13:31,548 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-12-02 15:13:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:13:31,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:31,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_549 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (or (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_549) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_550)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (not (= v_ArrVal_547 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_547 .cse0))))))) is different from false [2023-12-02 15:13:31,774 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_550 Int) (v_ArrVal_549 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int) (v_DerPreprocessor_2 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_549) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_550) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1)))) is different from false [2023-12-02 15:13:31,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:13:31,790 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 50 treesize of output 51 [2023-12-02 15:13:31,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:13:31,804 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 104 treesize of output 103 [2023-12-02 15:13:31,818 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 39 treesize of output 23 [2023-12-02 15:13:31,883 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_550 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_ArrVal_550) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_545) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int)) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_ArrVal_550) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2023-12-02 15:13:31,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_545) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_DerPreprocessor_2) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_550 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_546) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_ArrVal_550) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_550 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_546) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_50| 8) v_ArrVal_550) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2023-12-02 15:13:32,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:13:32,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 83 [2023-12-02 15:13:32,592 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-12-02 15:13:32,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 86 [2023-12-02 15:13:32,823 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-12-02 15:13:32,855 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 541 treesize of output 539 [2023-12-02 15:13:32,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:13:32,901 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 35 treesize of output 33 [2023-12-02 15:13:32,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:13:32,908 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 62 treesize of output 60 [2023-12-02 15:13:32,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:13:32,934 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 23 treesize of output 21 [2023-12-02 15:13:32,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:13:32,939 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 38 treesize of output 36 [2023-12-02 15:13:33,101 INFO L349 Elim1Store]: treesize reduction 37, result has 50.7 percent of original size [2023-12-02 15:13:33,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 5402 treesize of output 5306 [2023-12-02 15:13:33,243 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 1781 treesize of output 1721 [2023-12-02 15:13:33,291 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 1705 treesize of output 1643 [2023-12-02 15:13:33,336 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 1285 treesize of output 1261 [2023-12-02 15:13:33,381 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 1409 treesize of output 1379 [2023-12-02 15:13:33,418 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 985 treesize of output 961 [2023-12-02 15:13:33,480 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 774 treesize of output 772 [2023-12-02 15:13:33,517 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 776 treesize of output 766 [2023-12-02 15:13:33,548 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 788 treesize of output 780 [2023-12-02 15:13:33,671 INFO L349 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-12-02 15:13:33,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 803 treesize of output 823 [2023-12-02 15:13:33,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:13:33,875 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 1000 treesize of output 998 [2023-12-02 15:13:33,977 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 895 treesize of output 889 [2023-12-02 15:13:34,047 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 862 treesize of output 858 [2023-12-02 15:13:34,458 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 9 treesize of output 1 [2023-12-02 15:13:34,490 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-02 15:13:34,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 15:13:34,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:13:34,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-12-02 15:13:34,510 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-12-02 15:13:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-02 15:13:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337220097] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2043470068] [2023-12-02 15:13:34,993 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:34,993 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:34,994 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:34,994 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:34,994 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:35,875 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:35,883 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:37,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '930#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_29| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_29| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_29|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_29| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-12-02 15:13:37,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:13:37,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:37,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 50 [2023-12-02 15:13:37,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812172298] [2023-12-02 15:13:37,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:13:37,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 15:13:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:37,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 15:13:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3209, Unknown=27, NotChecked=468, Total=3906 [2023-12-02 15:13:37,560 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 15:13:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:39,239 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2023-12-02 15:13:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 15:13:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-12-02 15:13:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:39,242 INFO L225 Difference]: With dead ends: 50 [2023-12-02 15:13:39,242 INFO L226 Difference]: Without dead ends: 48 [2023-12-02 15:13:39,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=352, Invalid=4749, Unknown=27, NotChecked=572, Total=5700 [2023-12-02 15:13:39,246 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 122 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:39,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 190 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 610 Invalid, 0 Unknown, 212 Unchecked, 0.7s Time] [2023-12-02 15:13:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-02 15:13:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2023-12-02 15:13:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:13:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2023-12-02 15:13:39,261 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2023-12-02 15:13:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:39,261 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2023-12-02 15:13:39,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 44 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 15:13:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2023-12-02 15:13:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:13:39,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:39,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:39,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 15:13:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:39,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:39,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1538477275, now seen corresponding path program 3 times [2023-12-02 15:13:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313854863] [2023-12-02 15:13:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 15:13:39,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313854863] [2023-12-02 15:13:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313854863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:13:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:13:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:13:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585604834] [2023-12-02 15:13:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:13:39,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:13:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:13:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:13:39,563 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:13:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:39,641 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-12-02 15:13:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:13:39,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-12-02 15:13:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:39,644 INFO L225 Difference]: With dead ends: 42 [2023-12-02 15:13:39,644 INFO L226 Difference]: Without dead ends: 37 [2023-12-02 15:13:39,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:13:39,646 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:39,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 35 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:13:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-02 15:13:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-02 15:13:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:13:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-12-02 15:13:39,660 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2023-12-02 15:13:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:39,661 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-12-02 15:13:39,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:13:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-12-02 15:13:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:13:39,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:39,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:39,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:13:39,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:39,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1738203898, now seen corresponding path program 4 times [2023-12-02 15:13:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:39,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515805373] [2023-12-02 15:13:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:39,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:39,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515805373] [2023-12-02 15:13:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515805373] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:39,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119982360] [2023-12-02 15:13:39,783 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 15:13:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:39,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:39,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:13:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:39,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:13:39,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:40,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119982360] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1171437765] [2023-12-02 15:13:40,051 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:40,052 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:40,052 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:40,052 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:40,052 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:41,020 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:41,032 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:42,079 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1412#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (not (= 3 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2023-12-02 15:13:42,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:13:42,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-02 15:13:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484447437] [2023-12-02 15:13:42,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:13:42,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:13:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:13:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-12-02 15:13:42,081 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:13:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:42,173 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-12-02 15:13:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:13:42,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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-12-02 15:13:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:42,175 INFO L225 Difference]: With dead ends: 51 [2023-12-02 15:13:42,175 INFO L226 Difference]: Without dead ends: 41 [2023-12-02 15:13:42,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2023-12-02 15:13:42,176 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:42,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:13:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-02 15:13:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-12-02 15:13:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:13:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-12-02 15:13:42,188 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 25 [2023-12-02 15:13:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:42,188 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-12-02 15:13:42,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:13:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-12-02 15:13:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:13:42,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:42,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:42,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 15:13:42,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:42,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:42,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1511154560, now seen corresponding path program 5 times [2023-12-02 15:13:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542024109] [2023-12-02 15:13:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 15:13:42,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542024109] [2023-12-02 15:13:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542024109] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453201772] [2023-12-02 15:13:42,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:13:42,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:42,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:42,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:42,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:13:43,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 15:13:43,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:13:43,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:13:43,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 15:13:43,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:13:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453201772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:13:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:13:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-02 15:13:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875643626] [2023-12-02 15:13:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:13:43,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:13:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:43,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:13:43,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:13:43,466 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:13:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:43,536 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-12-02 15:13:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:13:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-12-02 15:13:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:43,539 INFO L225 Difference]: With dead ends: 49 [2023-12-02 15:13:43,540 INFO L226 Difference]: Without dead ends: 37 [2023-12-02 15:13:43,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:13:43,541 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:43,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:13:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-02 15:13:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-02 15:13:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:13:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-12-02 15:13:43,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2023-12-02 15:13:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:43,555 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-12-02 15:13:43,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:13:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-12-02 15:13:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 15:13:43,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:43,557 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-12-02 15:13:43,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:13:43,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:43,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:43,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1322563324, now seen corresponding path program 1 times [2023-12-02 15:13:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213913701] [2023-12-02 15:13:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:13:44,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213913701] [2023-12-02 15:13:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213913701] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584002230] [2023-12-02 15:13:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:44,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:44,392 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:44,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:13:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:44,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 15:13:44,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:44,656 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 13 treesize of output 9 [2023-12-02 15:13:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:44,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:44,893 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 38 treesize of output 32 [2023-12-02 15:13:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:13:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584002230] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520633771] [2023-12-02 15:13:44,991 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:44,992 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:44,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:44,992 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:44,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:45,823 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:45,830 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:47,423 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2005#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_45| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_#in~index#1_25| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_45| Int)) (and (or (and (= |ULTIMATE.start_main_~i~0#1| 1) (= 3 |ULTIMATE.start_main_~expected~0#1|) (= |v_ULTIMATE.start_dll_circular_get_data_at_#in~index#1_25| 1)) (= |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_45| 0)) (<= |v_ULTIMATE.start_dll_circular_get_data_at_#in~index#1_25| 1) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_45|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_45| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|))) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2023-12-02 15:13:47,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:13:47,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:47,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 30 [2023-12-02 15:13:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176267443] [2023-12-02 15:13:47,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:13:47,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 15:13:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 15:13:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2023-12-02 15:13:47,426 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:13:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:47,986 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2023-12-02 15:13:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 15:13:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-12-02 15:13:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:47,987 INFO L225 Difference]: With dead ends: 47 [2023-12-02 15:13:47,987 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 15:13:47,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=310, Invalid=2769, Unknown=1, NotChecked=0, Total=3080 [2023-12-02 15:13:47,988 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:47,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 208 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:13:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 15:13:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2023-12-02 15:13:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:13:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-12-02 15:13:47,998 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2023-12-02 15:13:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:47,998 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-12-02 15:13:47,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:13:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-12-02 15:13:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:13:47,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:47,999 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-12-02 15:13:48,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:13:48,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 15:13:48,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:48,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1952583442, now seen corresponding path program 2 times [2023-12-02 15:13:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462647818] [2023-12-02 15:13:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:13:48,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462647818] [2023-12-02 15:13:48,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462647818] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60235526] [2023-12-02 15:13:48,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:13:48,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:48,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:48,315 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:48,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:13:48,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 15:13:48,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:13:48,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:13:48,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:13:48,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:13:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60235526] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716657439] [2023-12-02 15:13:48,633 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:48,634 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:48,634 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:48,634 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:48,634 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:49,532 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:49,539 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:50,454 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2356#(and (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_56| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_56| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_56|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_56| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_main_~expected~0#1|) (<= 1 |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-12-02 15:13:50,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:13:50,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-02 15:13:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159841980] [2023-12-02 15:13:50,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:13:50,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:13:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:13:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2023-12-02 15:13:50,455 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:13:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:50,533 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-12-02 15:13:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:13:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-02 15:13:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:50,534 INFO L225 Difference]: With dead ends: 45 [2023-12-02 15:13:50,534 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 15:13:50,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-12-02 15:13:50,535 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:50,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:13:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 15:13:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-02 15:13:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:13:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-02 15:13:50,545 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2023-12-02 15:13:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:50,545 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-02 15:13:50,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 15:13:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-02 15:13:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 15:13:50,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:13:50,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:13:50,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:13:50,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 15:13:50,747 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:13:50,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:13:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash 116751330, now seen corresponding path program 6 times [2023-12-02 15:13:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:13:50,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54051090] [2023-12-02 15:13:50,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:13:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:13:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:13:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:13:50,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:13:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54051090] [2023-12-02 15:13:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54051090] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:13:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898225636] [2023-12-02 15:13:50,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 15:13:50,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:50,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:13:50,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:13:50,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:13:51,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 15:13:51,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:13:51,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 15:13:51,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:13:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:13:51,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:13:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 15:13:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898225636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:13:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201105711] [2023-12-02 15:13:52,002 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 15:13:52,002 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:13:52,003 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:13:52,003 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:13:52,003 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:13:52,744 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 15:13:52,751 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:13:53,661 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2673#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (exists ((|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_62| Int) (|v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_62| Int)) (= (select (select |#memory_int| |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.base_62|) (+ |v_ULTIMATE.start_dll_circular_get_data_at_~head#1.offset_62| 8)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|)))' at error location [2023-12-02 15:13:53,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:13:53,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:13:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 12 [2023-12-02 15:13:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383297187] [2023-12-02 15:13:53,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:13:53,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:13:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:13:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:13:53,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=520, Unknown=1, NotChecked=0, Total=600 [2023-12-02 15:13:53,664 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-02 15:13:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:13:53,735 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-12-02 15:13:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:13:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 30 [2023-12-02 15:13:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:13:53,735 INFO L225 Difference]: With dead ends: 28 [2023-12-02 15:13:53,735 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 15:13:53,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=605, Unknown=2, NotChecked=0, Total=702 [2023-12-02 15:13:53,737 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:13:53,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:13:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 15:13:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 15:13:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:13:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 15:13:53,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-12-02 15:13:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:13:53,739 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 15:13:53,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-02 15:13:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 15:13:53,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 15:13:53,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:13:53,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:13:53,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:13:53,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 15:14:03,384 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (exists ((|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 8 1))) (= (store |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 4 (select .cse0 4))) |v_#memory_int_48|) (= |v_#memory_int_47| (store |v_#memory_int_115| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse1 0))))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_old(#memory_int)_AFTER_CALL_3| 1))) (and (= (select .cse2 1) 0) (= (select .cse2 0) 48)))) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (exists ((|v_#valid_26| (Array Int Int))) (and (= (store |v_#valid_26| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|) (= (select |v_#valid_26| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (exists ((|v_#length_18| (Array Int Int))) (= |#length| (store |v_#length_18| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1)) [2023-12-02 15:14:03,385 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-12-02 15:14:03,385 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-12-02 15:14:03,385 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse1 (not (= .cse8 |ULTIMATE.start_main_~s~0#1.base|))) (.cse0 (= (select (select |#memory_int| .cse8) 8) 3)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse3 (not (= .cse8 0))) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2023-12-02 15:14:03,385 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 15:14:03,385 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-12-02 15:14:03,385 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-12-02 15:14:03,385 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse1 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (and (= (select (select |#memory_int| .cse0) 8) 3) .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) (not (= .cse0 0)) .cse2 .cse3 .cse4 .cse5)) (and (<= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5))) [2023-12-02 15:14:03,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2023-12-02 15:14:03,386 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))) [2023-12-02 15:14:03,386 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-02 15:14:03,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 15:14:03,386 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse1 (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse2 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| 0)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) 0) 0)) (.cse3 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse13 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) 0)) (.cse6 (not (= .cse5 0))) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 |ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) .cse6 (not .cse7) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 1) .cse1 .cse2 .cse12 (not (= .cse13 |ULTIMATE.start_main_~s~0#1.base|)) .cse4 .cse6 .cse8 .cse9 .cse7 .cse10 .cse11) (and .cse0 (= (select (select |#memory_int| .cse5) 8) 3) .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse12 .cse3 (not (= .cse13 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) .cse6 (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse8 .cse9 .cse7 .cse10 .cse11)))) [2023-12-02 15:14:03,386 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-12-02 15:14:03,386 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-02 15:14:03,387 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 626 645) no Hoare annotation was computed. [2023-12-02 15:14:03,387 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse2 (<= 1 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse4 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (exists ((|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_int_48| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |#memory_int| (store |v_#memory_int_48| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 8 1))) (= (store |v_#memory_int_47| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 4 (select .cse0 4))) |v_#memory_int_48|) (= |v_#memory_int_47| (store |v_#memory_int_115| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse1 0))))))) .cse2 .cse3 .cse4 (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_int)_AFTER_CALL_3| 1))) (and (= (select .cse5 1) 0) (= (select .cse5 0) 48)))) .cse6 (exists ((|v_#valid_26| (Array Int Int))) (and (= (store |v_#valid_26| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#valid|) (= (select |v_#valid_26| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (exists ((|v_#length_18| (Array Int Int))) (= |#length| (store |v_#length_18| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 12))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse7 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select .cse8 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))))) .cse9 .cse10 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) .cse11 .cse12) (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (= (select .cse8 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse9 .cse10 (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 0)) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse12 (not .cse11)))) [2023-12-02 15:14:03,387 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 8)) (.cse11 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse0 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8) 2)) (.cse1 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse3 (not (= .cse12 0))) (.cse4 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse5 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse2 .cse3 .cse4 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0) .cse5 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) .cse6 .cse7 .cse8 (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 0)) 8)) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse9) (and (= |ULTIMATE.start_main_~i~0#1| 0) (= 2 .cse10) .cse11 .cse0 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9) (and (= 3 .cse10) (= (select (select |#memory_int| .cse12) 8) 3) .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| 0)))))) [2023-12-02 15:14:03,387 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-12-02 15:14:03,387 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-02 15:14:03,387 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (or (not (= |node_create_#in~data#1| 1)) (< |#StackHeapBarrier| 1) (= |old(#valid)| |#valid|)) [2023-12-02 15:14:03,387 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-12-02 15:14:03,389 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2023-12-02 15:14:03,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:14:03,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:14:03,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,406 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:14:03,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:14:03,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-12-02 15:14:03,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-12-02 15:14:03,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-12-02 15:14:03,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-12-02 15:14:03,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-12-02 15:14:03,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-12-02 15:14:03,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_115 : [int,int]int, v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int :: (#memory_int == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][8 := 1]] && v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][4 := v_#memory_int_48[~head~0!base][4]]] == v_#memory_int_48) && v_#memory_int_47 == v_#memory_int_115[~head~0!base := v_#memory_int_115[~head~0!base][0 := v_#memory_int_47[~head~0!base][0]]]) could not be translated [2023-12-02 15:14:03,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_old(#memory_int)_AFTER_CALL_3 : [int,int]int :: v_old_#memory_int__AFTER_CALL_3[1][1] == 0 && v_old_#memory_int__AFTER_CALL_3[1][0] == 48) could not be translated [2023-12-02 15:14:03,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_26 : [int]int :: v_#valid_26[~head~0!base := 1] == #valid && v_#valid_26[~head~0!base] == 0) could not be translated [2023-12-02 15:14:03,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_18 : [int]int :: #length == v_#length_18[~head~0!base := 12]) could not be translated [2023-12-02 15:14:03,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_67 : [int,int]int :: v_#memory_$Pointer$.base_67[~head~0!base := v_#memory_$Pointer$.base_67[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]] == #memory_$Pointer$.base) could not be translated [2023-12-02 15:14:03,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_67[~head~0!base := v_#memory_$Pointer$.offset_67[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) could not be translated [2023-12-02 15:14:03,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated [2023-12-02 15:14:03,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~last~0!base := #memory_$Pointer$.offset[~last~0!base][0 := 0]][~head~0!base][0] could not be translated [2023-12-02 15:14:03,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-12-02 15:14:03,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] could not be translated [2023-12-02 15:14:03,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:14:03,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-12-02 15:14:03,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated [2023-12-02 15:14:03,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 15:14:03,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 15:14:03,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 15:14:03,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:14:03 BoogieIcfgContainer [2023-12-02 15:14:03,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:14:03,426 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:14:03,426 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:14:03,426 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:14:03,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:13:19" (3/4) ... [2023-12-02 15:14:03,428 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 15:14:03,432 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 15:14:03,437 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-12-02 15:14:03,438 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-12-02 15:14:03,438 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 15:14:03,438 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 15:14:03,460 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1))) [2023-12-02 15:14:03,462 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((index == 1) && (\old(index) == 1)) || (index <= 0)) || (index <= 0)) [2023-12-02 15:14:03,478 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1))) [2023-12-02 15:14:03,481 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((index == 1) && (\old(index) == 1)) || (index <= 0)) || (index <= 0)) [2023-12-02 15:14:03,520 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:14:03,521 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 15:14:03,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:14:03,521 INFO L158 Benchmark]: Toolchain (without parser) took 44671.09ms. Allocated memory was 159.4MB in the beginning and 499.1MB in the end (delta: 339.7MB). Free memory was 120.2MB in the beginning and 312.5MB in the end (delta: -192.3MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,522 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:14:03,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.13ms. Allocated memory is still 159.4MB. Free memory was 119.6MB in the beginning and 101.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.00ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 99.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,522 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 159.4MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,523 INFO L158 Benchmark]: RCFGBuilder took 458.15ms. Allocated memory is still 159.4MB. Free memory was 98.0MB in the beginning and 76.5MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,523 INFO L158 Benchmark]: TraceAbstraction took 43656.68ms. Allocated memory was 159.4MB in the beginning and 499.1MB in the end (delta: 339.7MB). Free memory was 76.1MB in the beginning and 317.7MB in the end (delta: -241.6MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,523 INFO L158 Benchmark]: Witness Printer took 95.03ms. Allocated memory is still 499.1MB. Free memory was 317.7MB in the beginning and 312.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 15:14:03,525 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.20ms. Allocated memory is still 113.2MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.13ms. Allocated memory is still 159.4MB. Free memory was 119.6MB in the beginning and 101.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.00ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 99.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 159.4MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.15ms. Allocated memory is still 159.4MB. Free memory was 98.0MB in the beginning and 76.5MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 43656.68ms. Allocated memory was 159.4MB in the beginning and 499.1MB in the end (delta: 339.7MB). Free memory was 76.1MB in the beginning and 317.7MB in the end (delta: -241.6MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Witness Printer took 95.03ms. Allocated memory is still 499.1MB. Free memory was 317.7MB in the beginning and 312.5MB 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: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!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: Expression #in~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: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!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_int[#memory_$Pointer$.base[~s~0!base][0]][8] 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: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] 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: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: ArrayAccessExpression #memory_$Pointer$.base[~s~0!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: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_int_115 : [int,int]int, v_#memory_int_47 : [int,int]int, v_#memory_int_48 : [int,int]int :: (#memory_int == v_#memory_int_48[~head~0!base := v_#memory_int_48[~head~0!base][8 := 1]] && v_#memory_int_47[~head~0!base := v_#memory_int_47[~head~0!base][4 := v_#memory_int_48[~head~0!base][4]]] == v_#memory_int_48) && v_#memory_int_47 == v_#memory_int_115[~head~0!base := v_#memory_int_115[~head~0!base][0 := v_#memory_int_47[~head~0!base][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_old(#memory_int)_AFTER_CALL_3 : [int,int]int :: v_old_#memory_int__AFTER_CALL_3[1][1] == 0 && v_old_#memory_int__AFTER_CALL_3[1][0] == 48) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_26 : [int]int :: v_#valid_26[~head~0!base := 1] == #valid && v_#valid_26[~head~0!base] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_18 : [int]int :: #length == v_#length_18[~head~0!base := 12]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.base_67 : [int,int]int :: v_#memory_$Pointer$.base_67[~head~0!base := v_#memory_$Pointer$.base_67[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.base[~head~0!base][8]]] == #memory_$Pointer$.base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_67 : [int,int]int :: #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_67[~head~0!base := v_#memory_$Pointer$.offset_67[~head~0!base][0 := 0][4 := 0][8 := #memory_$Pointer$.offset[~head~0!base][8]]]) 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 #memory_$Pointer$.offset[~last~0!base := #memory_$Pointer$.offset[~last~0!base][0 := 0]][~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][8] 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 #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 212 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1446 IncrementalHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 129 mSDtfsCounter, 1446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 675 GetRequests, 394 SyntacticMatches, 18 SemanticMatches, 263 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 26 NumberOfFragments, 1023 HoareAnnotationTreeSize, 11 FomulaSimplifications, 1814 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 708 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 479 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 629 ConstructedInterpolants, 9 QuantifiedInterpolants, 3156 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 246/326 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.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 16, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 31, TOOLS_POST_TIME: 0.5s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 1.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 91, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 8, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 14, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 16, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 0.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 14, CALL_SUMMARIZER_APPLICATIONS: 6, 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: 226, DAG_COMPRESSION_RETAINED_NODES: 58, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: (((((3 == data) && (index == 0)) && (data == 1)) || (((index == 1) && (3 == data)) && (data == 1))) || (((index == 0) && (2 == data)) && (data == 1))) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((i == 1) && (data == 1)) && (len == 2)) || (((i <= 0) && (data == 1)) && (len == 2))) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: (((((i == 0) && (data == 1)) && (len == 2)) || (((i == 1) && (data == 1)) && (len == 2))) || (((i <= 0) && (data == 1)) && (len == 2))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((\old(data) == 1) && (\old(len) == 2)) && (2 == len)) && (data == 1)) && (len == 2)) && (data == 1)) || ((((((\old(data) == 1) && (\old(len) == 2)) && (len == 1)) && (data == 1)) && (len == 2)) && (data == 1))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((index == 1) && (\old(index) == 1)) || (index <= 0)) || (index <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-02 15:14:03,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b5a09b6-1544-4567-8b72-70df10f84cab/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE