./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:46:17,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:46:17,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:46:17,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:46:17,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:46:17,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:46:17,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:46:17,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:46:17,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:46:17,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:46:17,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:46:17,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:46:17,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:46:17,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:46:17,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:46:17,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:46:17,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:46:17,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:46:17,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:46:17,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:46:17,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:46:17,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:46:17,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:46:17,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:46:17,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:46:17,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:46:17,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:46:17,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:46:17,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:46:17,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:46:17,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:46:17,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:46:17,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:46:17,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:46:17,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:46:17,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:46:17,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:46:17,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:46:17,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:46:17,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:46:17,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:46:17,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:46:17,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:46:17,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:46:17,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:46:17,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:46:17,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:46:17,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:46:17,584 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:46:17,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:46:17,585 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:46:17,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:46:17,585 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:46:17,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:46:17,585 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:46:17,586 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:46:17,586 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:46:17,586 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:46:17,586 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:46:17,586 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:46:17,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:46:17,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:46:17,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:46:17,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:46:17,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:46:17,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:46:17,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:46:17,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:46:17,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:46:17,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:46:17,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:46:17,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:46:17,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:46:17,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:46:17,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:46:17,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:46:17,590 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:46:17,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:46:17,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:46:17,591 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:46:17,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:46:17,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:46:17,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:46:17,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/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_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-12-14 07:46:17,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:46:17,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:46:17,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:46:17,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:46:17,799 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:46:17,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-12-14 07:46:20,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:46:20,589 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:46:20,589 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-12-14 07:46:20,597 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/data/032a9e1b0/62619a2389bc47baa4d2ec3b65982495/FLAG0443de269 [2022-12-14 07:46:20,607 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/data/032a9e1b0/62619a2389bc47baa4d2ec3b65982495 [2022-12-14 07:46:20,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:46:20,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:46:20,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:46:20,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:46:20,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:46:20,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a8ea01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20, skipping insertion in model container [2022-12-14 07:46:20,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:46:20,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:46:20,829 WARN L237 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_ad8c90e5-2105-43ff-91b4-29d36837c64f/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-12-14 07:46:20,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:46:20,840 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:46:20,869 WARN L237 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_ad8c90e5-2105-43ff-91b4-29d36837c64f/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-12-14 07:46:20,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:46:20,888 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:46:20,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20 WrapperNode [2022-12-14 07:46:20,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:46:20,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:46:20,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:46:20,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:46:20,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,920 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-12-14 07:46:20,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:46:20,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:46:20,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:46:20,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:46:20,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:46:20,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:46:20,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:46:20,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:46:20,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (1/1) ... [2022-12-14 07:46:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:46:20,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:20,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:46:20,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:46:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:46:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:46:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:46:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:46:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:46:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:46:21,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:46:21,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:46:21,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:46:21,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:46:21,081 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:46:21,083 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:46:21,231 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:46:21,285 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:46:21,285 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 07:46:21,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:21 BoogieIcfgContainer [2022-12-14 07:46:21,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:46:21,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:46:21,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:46:21,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:46:21,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:46:20" (1/3) ... [2022-12-14 07:46:21,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2197449b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:21, skipping insertion in model container [2022-12-14 07:46:21,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:20" (2/3) ... [2022-12-14 07:46:21,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2197449b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:21, skipping insertion in model container [2022-12-14 07:46:21,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:21" (3/3) ... [2022-12-14 07:46:21,297 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-12-14 07:46:21,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:46:21,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 07:46:21,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:46:21,360 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=LoopsAndPotentialCycles, 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;@144ddb43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:46:21,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 07:46:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 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) [2022-12-14 07:46:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:46:21,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:21,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:21,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:21,375 INFO L85 PathProgramCache]: Analyzing trace with hash 188652621, now seen corresponding path program 1 times [2022-12-14 07:46:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:21,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182713831] [2022-12-14 07:46:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:21,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182713831] [2022-12-14 07:46:21,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182713831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:21,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:21,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:46:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020563521] [2022-12-14 07:46:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:21,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:46:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:46:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:46:21,650 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-12-14 07:46:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:21,698 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-12-14 07:46:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:46:21,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2022-12-14 07:46:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:21,708 INFO L225 Difference]: With dead ends: 27 [2022-12-14 07:46:21,708 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 07:46:21,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:46:21,715 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:21,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 07:46:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-12-14 07:46:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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) [2022-12-14 07:46:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-12-14 07:46:21,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2022-12-14 07:46:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:21,747 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-12-14 07:46:21,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-12-14 07:46:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-12-14 07:46:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:46:21,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:21,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:21,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:46:21,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1236248315, now seen corresponding path program 1 times [2022-12-14 07:46:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:21,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846484378] [2022-12-14 07:46:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:21,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:21,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846484378] [2022-12-14 07:46:21,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846484378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:21,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453639495] [2022-12-14 07:46:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:21,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:21,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:21,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:21,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:46:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:21,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:46:21,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:21,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:22,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453639495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:22,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [539414715] [2022-12-14 07:46:22,024 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-12-14 07:46:22,024 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:22,027 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:22,031 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:22,031 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:22,120 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 07:46:22,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 07:46:22,168 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:22,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:22,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:22,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:22,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:22,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:22,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:22,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:22,409 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:22,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:22,451 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:22,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:22,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,761 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:22,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-12-14 07:46:22,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,798 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:22,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-12-14 07:46:22,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,879 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:22,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-12-14 07:46:22,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:22,915 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 07:46:22,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-12-14 07:46:22,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:22,961 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:22,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:22,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:23,006 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:23,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:23,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:23,188 INFO L350 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 [2022-12-14 07:46:23,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:23,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:23,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:23,216 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:23,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:23,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:23,232 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:23,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:23,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:23,247 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:23,278 INFO L350 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 [2022-12-14 07:46:23,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:23,288 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:23,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [539414715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:23,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:23,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-12-14 07:46:23,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734393401] [2022-12-14 07:46:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:23,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:46:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:23,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:46:23,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:46:23,454 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-12-14 07:46:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:23,497 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-12-14 07:46:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:46:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2022-12-14 07:46:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:23,498 INFO L225 Difference]: With dead ends: 18 [2022-12-14 07:46:23,498 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 07:46:23,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:46:23,499 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 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 [2022-12-14 07:46:23,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 07:46:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-12-14 07:46:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 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) [2022-12-14 07:46:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-12-14 07:46:23,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-12-14 07:46:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:23,503 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-12-14 07:46:23,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-12-14 07:46:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-12-14 07:46:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:46:23,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:23,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:23,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:46:23,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:23,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash -660348294, now seen corresponding path program 1 times [2022-12-14 07:46:23,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:23,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611547214] [2022-12-14 07:46:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:46:23,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611547214] [2022-12-14 07:46:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611547214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443775607] [2022-12-14 07:46:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:23,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:23,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:46:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:23,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:46:23,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:46:23,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:46:23,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443775607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:23,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1816090686] [2022-12-14 07:46:23,965 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:23,965 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:23,965 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:23,965 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:23,965 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:24,000 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:24,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:24,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:46:24,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:24,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:24,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:24,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:24,175 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:24,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:24,207 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:24,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:24,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,455 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:24,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-12-14 07:46:24,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,489 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:24,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-12-14 07:46:24,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,566 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:24,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2022-12-14 07:46:24,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,600 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 07:46:24,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2022-12-14 07:46:24,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,635 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:24,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:24,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,671 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:24,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:24,856 INFO L350 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 [2022-12-14 07:46:24,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:24,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,886 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:24,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,901 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:24,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:24,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:24,916 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:24,956 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:24,959 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:24,960 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:24,977 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:24,978 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:24,980 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:24,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:25,001 INFO L350 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 [2022-12-14 07:46:25,004 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:25,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1816090686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:25,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:25,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2022-12-14 07:46:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346654793] [2022-12-14 07:46:25,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:25,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:46:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:25,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:46:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:25,231 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-12-14 07:46:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:25,289 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2022-12-14 07:46:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:46:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2022-12-14 07:46:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:25,290 INFO L225 Difference]: With dead ends: 21 [2022-12-14 07:46:25,290 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 07:46:25,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:46:25,291 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:25,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 07:46:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-12-14 07:46:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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) [2022-12-14 07:46:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-12-14 07:46:25,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2022-12-14 07:46:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:25,295 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-12-14 07:46:25,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-12-14 07:46:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-12-14 07:46:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:46:25,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:25,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:25,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 07:46:25,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:25,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 384828029, now seen corresponding path program 1 times [2022-12-14 07:46:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:25,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663193935] [2022-12-14 07:46:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:46:25,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663193935] [2022-12-14 07:46:25,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663193935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:25,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532991067] [2022-12-14 07:46:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:25,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:25,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:25,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:25,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:46:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:25,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:46:25,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:46:25,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:46:25,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532991067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:25,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [160084129] [2022-12-14 07:46:25,681 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:25,681 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:25,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:25,681 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:25,681 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:25,710 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:25,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:25,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:46:25,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:25,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:25,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:25,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:25,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:25,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:25,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:25,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:25,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:25,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:25,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:25,871 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:25,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:25,895 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:25,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:26,119 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-12-14 07:46:26,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 292 [2022-12-14 07:46:26,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:26,224 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:26,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 314 [2022-12-14 07:46:26,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:26,297 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:26,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 299 treesize of output 308 [2022-12-14 07:46:26,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:26,359 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-12-14 07:46:26,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 325 treesize of output 307 [2022-12-14 07:46:26,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:26,410 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:26,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:26,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:26,448 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:26,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:27,037 INFO L350 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 [2022-12-14 07:46:27,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:27,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:27,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:27,060 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:27,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:27,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:27,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:27,075 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:27,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:27,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:27,089 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:27,118 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:27,120 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:27,122 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:27,188 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:27,194 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:27,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:27,291 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:27,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:27,304 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:27,357 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:27,363 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:27,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:27,418 INFO L350 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 [2022-12-14 07:46:27,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:27,426 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:27,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [160084129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:27,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:27,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-12-14 07:46:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14848536] [2022-12-14 07:46:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:27,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:46:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:46:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-14 07:46:27,751 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) [2022-12-14 07:46:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:27,960 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-12-14 07:46:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:46:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) Word has length 12 [2022-12-14 07:46:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:27,961 INFO L225 Difference]: With dead ends: 25 [2022-12-14 07:46:27,961 INFO L226 Difference]: Without dead ends: 20 [2022-12-14 07:46:27,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:46:27,962 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:27,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:46:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-14 07:46:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-12-14 07:46:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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) [2022-12-14 07:46:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-12-14 07:46:27,967 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2022-12-14 07:46:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:27,967 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-12-14 07:46:27,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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) [2022-12-14 07:46:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-12-14 07:46:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:46:27,967 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:27,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:27,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:46:28,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:28,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:28,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -956885555, now seen corresponding path program 1 times [2022-12-14 07:46:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865298011] [2022-12-14 07:46:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:46:28,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865298011] [2022-12-14 07:46:28,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865298011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922983963] [2022-12-14 07:46:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:28,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:28,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:28,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:46:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:28,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:46:28,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:46:28,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:46:28,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922983963] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1340779704] [2022-12-14 07:46:28,325 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:28,325 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:28,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:28,325 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:28,325 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:28,357 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 07:46:28,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 07:46:28,386 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:28,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:28,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:28,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:28,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:28,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:28,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:28,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:28,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:28,515 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:28,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:28,540 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:28,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:28,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,709 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:28,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 282 [2022-12-14 07:46:28,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,781 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:28,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 318 [2022-12-14 07:46:28,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,844 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:28,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 312 [2022-12-14 07:46:28,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:28,874 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 07:46:28,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 281 [2022-12-14 07:46:28,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:28,917 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:28,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:28,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:28,950 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:28,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:29,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:29,276 INFO L350 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 [2022-12-14 07:46:29,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:29,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:29,298 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:29,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:29,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:29,310 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:29,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:29,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:29,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:29,324 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:29,356 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:29,359 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:29,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:29,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:29,414 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:29,421 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:29,484 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:29,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:29,497 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:29,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:29,544 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:29,551 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:29,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:29,626 INFO L350 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 [2022-12-14 07:46:29,628 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:30,086 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '551#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:30,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:30,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:30,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-14 07:46:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330556807] [2022-12-14 07:46:30,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:30,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:46:30,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:46:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:46:30,088 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-12-14 07:46:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:30,116 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-12-14 07:46:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:46:30,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 13 [2022-12-14 07:46:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:30,117 INFO L225 Difference]: With dead ends: 28 [2022-12-14 07:46:30,117 INFO L226 Difference]: Without dead ends: 17 [2022-12-14 07:46:30,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:46:30,118 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:30,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-14 07:46:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-14 07:46:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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) [2022-12-14 07:46:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-12-14 07:46:30,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-12-14 07:46:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:30,124 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-14 07:46:30,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-12-14 07:46:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-12-14 07:46:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 07:46:30,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:30,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:30,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:46:30,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:30,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1619728901, now seen corresponding path program 2 times [2022-12-14 07:46:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:30,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831807067] [2022-12-14 07:46:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:46:30,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:30,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831807067] [2022-12-14 07:46:30,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831807067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:30,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999943728] [2022-12-14 07:46:30,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:46:30,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:30,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:30,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:46:30,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:46:30,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:46:30,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:46:30,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:46:30,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:46:30,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999943728] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:30,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881290524] [2022-12-14 07:46:30,566 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:30,566 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:30,566 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:30,566 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:30,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:30,594 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 07:46:30,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 07:46:30,620 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:30,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:30,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:30,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:30,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:30,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:30,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:30,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:30,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:30,765 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:30,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:30,793 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:30,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:30,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,921 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:30,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2022-12-14 07:46:30,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:30,960 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 07:46:30,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 221 [2022-12-14 07:46:30,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:31,027 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:31,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2022-12-14 07:46:31,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:31,086 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:31,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-12-14 07:46:31,102 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:31,126 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:31,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:31,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:31,168 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:31,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:31,303 INFO L350 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 [2022-12-14 07:46:31,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:31,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:31,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:31,325 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:31,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:31,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:31,339 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:31,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:31,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:31,351 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:31,379 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:31,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:31,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:31,425 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:31,431 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:31,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:31,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:31,512 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:31,517 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:31,560 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:31,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:31,572 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:31,635 INFO L350 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 [2022-12-14 07:46:31,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:31,642 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:32,124 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '731#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:32,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:32,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:32,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-12-14 07:46:32,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280065123] [2022-12-14 07:46:32,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:32,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:46:32,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:46:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:46:32,125 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 07:46:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:32,165 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-12-14 07:46:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:46:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 15 [2022-12-14 07:46:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:32,166 INFO L225 Difference]: With dead ends: 31 [2022-12-14 07:46:32,166 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 07:46:32,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:46:32,166 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:32,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 07:46:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-12-14 07:46:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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) [2022-12-14 07:46:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-12-14 07:46:32,172 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2022-12-14 07:46:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:32,172 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-12-14 07:46:32,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 07:46:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-12-14 07:46:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:46:32,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:32,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:32,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 07:46:32,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:32,374 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1080201052, now seen corresponding path program 3 times [2022-12-14 07:46:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:32,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922874848] [2022-12-14 07:46:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:46:33,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922874848] [2022-12-14 07:46:33,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922874848] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:33,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762641809] [2022-12-14 07:46:33,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:46:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:33,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:33,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:33,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:46:33,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:46:33,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:46:33,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 93 conjunts are in the unsatisfiable core [2022-12-14 07:46:33,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:33,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:46:33,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 07:46:33,594 INFO L350 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 [2022-12-14 07:46:33,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:46:33,720 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:46:33,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2022-12-14 07:46:33,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-12-14 07:46:33,727 INFO L350 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 36 treesize of output 38 [2022-12-14 07:46:33,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:33,815 INFO L350 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 45 treesize of output 38 [2022-12-14 07:46:33,820 INFO L350 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 30 treesize of output 32 [2022-12-14 07:46:33,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:33,826 INFO L350 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 35 treesize of output 34 [2022-12-14 07:46:33,937 INFO L350 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 71 treesize of output 47 [2022-12-14 07:46:33,942 INFO L350 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 49 treesize of output 31 [2022-12-14 07:46:33,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-12-14 07:46:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:46:34,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:34,158 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) 1))) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) 1) .cse0)))) is different from false [2022-12-14 07:46:34,320 INFO L350 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 90 treesize of output 68 [2022-12-14 07:46:34,401 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 07:46:34,401 INFO L350 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 15 treesize of output 11 [2022-12-14 07:46:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 07:46:34,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762641809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:34,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173331021] [2022-12-14 07:46:34,480 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:34,480 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:34,480 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:34,480 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:34,481 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:34,509 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 07:46:34,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 07:46:34,533 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:34,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:34,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:34,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:34,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:34,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:34,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:34,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:34,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:34,688 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:34,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:34,717 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:34,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:34,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,858 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:34,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2022-12-14 07:46:34,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,943 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:34,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2022-12-14 07:46:34,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:34,987 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 07:46:34,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 215 [2022-12-14 07:46:35,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:35,048 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:35,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2022-12-14 07:46:35,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:35,089 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:35,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:35,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:35,129 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:35,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:35,347 INFO L350 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 [2022-12-14 07:46:35,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:35,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:35,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:35,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:35,374 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:35,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:35,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:35,388 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:35,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:35,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:35,400 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:35,431 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:35,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:35,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:35,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:35,484 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:35,492 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:35,553 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:35,559 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:35,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:35,609 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:35,614 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:35,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:35,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:35,702 INFO L350 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 [2022-12-14 07:46:35,705 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:36,597 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '966#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:36,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:36,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:36,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 37 [2022-12-14 07:46:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737216294] [2022-12-14 07:46:36,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:36,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 07:46:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 07:46:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1752, Unknown=1, NotChecked=84, Total=1980 [2022-12-14 07:46:36,599 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) [2022-12-14 07:46:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:37,762 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-12-14 07:46:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 07:46:37,762 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) Word has length 17 [2022-12-14 07:46:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:37,763 INFO L225 Difference]: With dead ends: 41 [2022-12-14 07:46:37,763 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 07:46:37,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=411, Invalid=3132, Unknown=1, NotChecked=116, Total=3660 [2022-12-14 07:46:37,764 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 209 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:37,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 457 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2022-12-14 07:46:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 07:46:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-12-14 07:46:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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) [2022-12-14 07:46:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-12-14 07:46:37,775 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-12-14 07:46:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:37,775 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-12-14 07:46:37,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) [2022-12-14 07:46:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-12-14 07:46:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:46:37,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:37,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:37,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:46:37,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:37,977 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -875158322, now seen corresponding path program 4 times [2022-12-14 07:46:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:37,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786886794] [2022-12-14 07:46:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 07:46:38,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:38,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786886794] [2022-12-14 07:46:38,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786886794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:46:38,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:46:38,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:46:38,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256427452] [2022-12-14 07:46:38,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:38,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:46:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:38,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:46:38,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:46:38,092 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-12-14 07:46:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:38,145 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-12-14 07:46:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:46:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 18 [2022-12-14 07:46:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:38,147 INFO L225 Difference]: With dead ends: 33 [2022-12-14 07:46:38,147 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 07:46:38,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:46:38,148 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:38,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 07:46:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 07:46:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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) [2022-12-14 07:46:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-12-14 07:46:38,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-12-14 07:46:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:38,159 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-12-14 07:46:38,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-12-14 07:46:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-12-14 07:46:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:46:38,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:38,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:38,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 07:46:38,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1455356257, now seen corresponding path program 5 times [2022-12-14 07:46:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:38,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532926235] [2022-12-14 07:46:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:46:38,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:38,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532926235] [2022-12-14 07:46:38,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532926235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:38,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472076178] [2022-12-14 07:46:38,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:46:38,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:38,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:38,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:46:38,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 07:46:38,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:46:38,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:46:38,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:46:38,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:46:38,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472076178] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:38,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:46:38,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2022-12-14 07:46:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779369482] [2022-12-14 07:46:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:46:38,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:46:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:46:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-14 07:46:38,447 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 07:46:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:38,512 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-12-14 07:46:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:46:38,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 18 [2022-12-14 07:46:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:38,513 INFO L225 Difference]: With dead ends: 42 [2022-12-14 07:46:38,513 INFO L226 Difference]: Without dead ends: 34 [2022-12-14 07:46:38,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:46:38,514 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:38,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-14 07:46:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-12-14 07:46:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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) [2022-12-14 07:46:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-12-14 07:46:38,534 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-12-14 07:46:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:38,534 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-12-14 07:46:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-14 07:46:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-12-14 07:46:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:46:38,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:38,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:38,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:46:38,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:38,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash -461139389, now seen corresponding path program 6 times [2022-12-14 07:46:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:38,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420035294] [2022-12-14 07:46:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:38,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:46:38,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420035294] [2022-12-14 07:46:38,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420035294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279055479] [2022-12-14 07:46:38,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:46:38,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:38,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:38,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:38,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 07:46:39,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:46:39,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:46:39,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:46:39,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:46:39,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:46:39,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279055479] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:39,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1617458562] [2022-12-14 07:46:39,120 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:39,120 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:39,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:39,120 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:39,121 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:39,151 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 07:46:39,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 07:46:39,172 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:39,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:39,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:39,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:39,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:39,294 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-12-14 07:46:39,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-12-14 07:46:39,339 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-12-14 07:46:39,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-12-14 07:46:39,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,575 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:39,576 INFO L350 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 1 case distinctions, treesize of input 229 treesize of output 238 [2022-12-14 07:46:39,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,687 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:39,687 INFO L350 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 1 case distinctions, treesize of input 223 treesize of output 232 [2022-12-14 07:46:39,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,716 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:39,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 198 [2022-12-14 07:46:39,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,752 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:39,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 209 [2022-12-14 07:46:39,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,780 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:39,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:39,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,806 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:39,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:39,936 INFO L350 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 [2022-12-14 07:46:39,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:39,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,959 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:39,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,972 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:39,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:39,983 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:40,017 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:40,018 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:40,020 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:40,059 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:40,063 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:40,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:40,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:40,131 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:40,137 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:40,176 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:40,181 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:40,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:40,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:40,253 INFO L350 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 [2022-12-14 07:46:40,254 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:40,711 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1611#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:40,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:40,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:40,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-14 07:46:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147992730] [2022-12-14 07:46:40,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:40,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:46:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:46:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:46:40,713 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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) [2022-12-14 07:46:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:40,810 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-12-14 07:46:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:46:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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) Word has length 18 [2022-12-14 07:46:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:40,810 INFO L225 Difference]: With dead ends: 40 [2022-12-14 07:46:40,810 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 07:46:40,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-12-14 07:46:40,811 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:40,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 07:46:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 07:46:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2022-12-14 07:46:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-12-14 07:46:40,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2022-12-14 07:46:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:40,826 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-12-14 07:46:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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) [2022-12-14 07:46:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-12-14 07:46:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:46:40,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:40,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:40,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 07:46:41,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:41,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1893796027, now seen corresponding path program 1 times [2022-12-14 07:46:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:41,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908402359] [2022-12-14 07:46:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:46:41,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:41,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908402359] [2022-12-14 07:46:41,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908402359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:41,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904904931] [2022-12-14 07:46:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:41,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:41,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:41,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:41,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 07:46:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:41,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 07:46:41,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:41,472 INFO L350 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 15 treesize of output 11 [2022-12-14 07:46:41,543 INFO L350 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 22 treesize of output 10 [2022-12-14 07:46:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:46:41,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:41,621 INFO L350 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 36 treesize of output 32 [2022-12-14 07:46:41,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:46:41,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904904931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:41,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701928626] [2022-12-14 07:46:41,671 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:41,671 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:41,672 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:41,672 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:41,672 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:41,693 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 07:46:41,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-12-14 07:46:41,714 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:41,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:41,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:41,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:41,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:41,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:41,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:41,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:41,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:41,816 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-12-14 07:46:41,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-12-14 07:46:41,854 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-12-14 07:46:41,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-12-14 07:46:41,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:41,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,032 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-12-14 07:46:42,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-12-14 07:46:42,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,115 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:42,115 INFO L350 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 1 case distinctions, treesize of input 225 treesize of output 234 [2022-12-14 07:46:42,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,186 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:42,187 INFO L350 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 1 case distinctions, treesize of input 219 treesize of output 228 [2022-12-14 07:46:42,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,249 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-12-14 07:46:42,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 235 [2022-12-14 07:46:42,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:42,289 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:42,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:42,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:42,323 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:42,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:42,532 INFO L350 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 [2022-12-14 07:46:42,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:42,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:42,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:42,555 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:42,565 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:42,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:42,576 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:42,608 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:42,611 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:42,612 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:42,648 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:42,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:42,661 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:42,713 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:42,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:42,725 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:42,781 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:42,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:42,791 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:42,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:42,986 INFO L350 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 [2022-12-14 07:46:42,988 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:43,385 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1895#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:43,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:43,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:43,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2022-12-14 07:46:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663411681] [2022-12-14 07:46:43,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:43,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:46:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:43,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:46:43,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 07:46:43,387 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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) [2022-12-14 07:46:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:43,723 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-12-14 07:46:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:46:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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) Word has length 20 [2022-12-14 07:46:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:43,724 INFO L225 Difference]: With dead ends: 40 [2022-12-14 07:46:43,724 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 07:46:43,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=1678, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 07:46:43,725 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 73 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:43,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 69 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:46:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 07:46:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-12-14 07:46:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2022-12-14 07:46:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-12-14 07:46:43,737 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 20 [2022-12-14 07:46:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:43,737 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-12-14 07:46:43,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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) [2022-12-14 07:46:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-12-14 07:46:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 07:46:43,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:43,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:43,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 07:46:43,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:43,939 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:43,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1299538242, now seen corresponding path program 7 times [2022-12-14 07:46:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:43,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182360970] [2022-12-14 07:46:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:46:44,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182360970] [2022-12-14 07:46:44,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182360970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474705550] [2022-12-14 07:46:44,055 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:46:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:44,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:44,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 07:46:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:44,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:46:44,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 07:46:44,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 07:46:44,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474705550] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:44,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [191210931] [2022-12-14 07:46:44,196 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:44,196 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:44,196 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:44,196 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:44,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:44,228 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:44,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:44,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:46:44,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:44,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:44,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:44,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:44,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:44,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:44,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:44,358 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-12-14 07:46:44,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-12-14 07:46:44,411 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-12-14 07:46:44,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-12-14 07:46:44,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,581 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-12-14 07:46:44,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-12-14 07:46:44,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,684 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:44,684 INFO L350 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 1 case distinctions, treesize of input 225 treesize of output 234 [2022-12-14 07:46:44,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,768 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:44,768 INFO L350 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 1 case distinctions, treesize of input 219 treesize of output 228 [2022-12-14 07:46:44,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:44,841 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-12-14 07:46:44,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 235 [2022-12-14 07:46:44,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:44,881 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:44,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:44,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:44,917 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:44,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:45,038 INFO L350 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 [2022-12-14 07:46:45,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:45,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:45,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:45,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:45,069 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:45,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:45,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:45,081 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:45,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:45,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:45,092 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:45,122 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:45,123 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:45,124 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:45,167 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:45,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:45,180 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:45,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:45,247 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:45,253 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:45,295 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:45,300 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:45,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:45,389 INFO L350 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 [2022-12-14 07:46:45,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:45,397 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:45,879 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2172#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:45,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:45,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:45,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-12-14 07:46:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038606903] [2022-12-14 07:46:45,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:45,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:46:45,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:46:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:46:45,880 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-12-14 07:46:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:45,935 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-12-14 07:46:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:46:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 20 [2022-12-14 07:46:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:45,936 INFO L225 Difference]: With dead ends: 42 [2022-12-14 07:46:45,936 INFO L226 Difference]: Without dead ends: 22 [2022-12-14 07:46:45,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:46:45,936 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:45,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-14 07:46:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-12-14 07:46:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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) [2022-12-14 07:46:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-12-14 07:46:45,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-12-14 07:46:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:45,948 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-12-14 07:46:45,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-12-14 07:46:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-12-14 07:46:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 07:46:45,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:46:45,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:46:45,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 07:46:46,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 07:46:46,149 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:46:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:46:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1420212741, now seen corresponding path program 2 times [2022-12-14 07:46:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:46:46,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206411548] [2022-12-14 07:46:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:46:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:46:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:46:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:46:46,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:46:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206411548] [2022-12-14 07:46:46,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206411548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:46:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922374059] [2022-12-14 07:46:46,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:46:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:46:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:46:46,222 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:46:46,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 07:46:46,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:46:46,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:46:46,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:46:46,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:46:46,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:46:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 07:46:46,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922374059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:46:46,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1688726859] [2022-12-14 07:46:46,372 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-12-14 07:46:46,372 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:46:46,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:46:46,372 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:46:46,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:46:46,400 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 07:46:46,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-12-14 07:46:46,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 07:46:46,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:46,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-12-14 07:46:46,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:46,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-12-14 07:46:46,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:46:46,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:46,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-12-14 07:46:46,552 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-12-14 07:46:46,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-12-14 07:46:46,580 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 07:46:46,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-12-14 07:46:46,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,867 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:46,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 318 [2022-12-14 07:46:46,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,960 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-12-14 07:46:46,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 312 [2022-12-14 07:46:46,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:46,984 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 07:46:46,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 270 [2022-12-14 07:46:47,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:47,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:47,016 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 07:46:47,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 281 [2022-12-14 07:46:47,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:47,050 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:47,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:47,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:47,085 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-12-14 07:46:47,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-12-14 07:46:47,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:47,309 INFO L350 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 [2022-12-14 07:46:47,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:47,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:47,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:47,332 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:47,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:47,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:47,344 INFO L350 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 45 treesize of output 7 [2022-12-14 07:46:47,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:46:47,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:46:47,361 INFO L350 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 39 treesize of output 17 [2022-12-14 07:46:47,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:47,391 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:47,393 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:46:47,432 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:47,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:47,442 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:47,501 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:47,505 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:47,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:47,551 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:47,557 INFO L350 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 15 treesize of output 1 [2022-12-14 07:46:47,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:46:47,881 INFO L350 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 [2022-12-14 07:46:47,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 07:46:47,888 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:46:49,136 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2433#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (or (and (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= 3 |ULTIMATE.start_main_~expected~0#1|)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_51| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51| Int)) (and (<= 3 (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_51|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_51|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51|) 3))) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|))) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-12-14 07:46:49,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:46:49,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:46:49,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-14 07:46:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878749011] [2022-12-14 07:46:49,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:46:49,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:46:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:46:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:46:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-12-14 07:46:49,138 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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) [2022-12-14 07:46:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:46:49,196 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-12-14 07:46:49,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:46:49,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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) Word has length 21 [2022-12-14 07:46:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:46:49,197 INFO L225 Difference]: With dead ends: 22 [2022-12-14 07:46:49,197 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 07:46:49,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:46:49,198 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:46:49,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:46:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 07:46:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 07:46:49,199 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) [2022-12-14 07:46:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 07:46:49,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-12-14 07:46:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:46:49,199 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 07:46:49,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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) [2022-12-14 07:46:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 07:46:49,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 07:46:49,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 07:46:49,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 07:46:49,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 07:46:49,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 07:46:52,205 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-12-14 07:46:52,205 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse31 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse3 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse4 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse5 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse11 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse13 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse15 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse16 (= (* |ULTIMATE.start_main_~len~0#1| 2) (+ 2 |ULTIMATE.start_sll_update_at_~data#1|))) (.cse17 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse18 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse19 (<= .cse31 |ULTIMATE.start_main_~len~0#1|)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse22 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse23 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse24 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse27 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse28 (<= |ULTIMATE.start_main_~len~0#1| .cse31)) (.cse29 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse27 .cse28 .cse29) (let ((.cse30 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse30)) .cse24 .cse25 .cse26 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| .cse30) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse27 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse28 .cse29))))) [2022-12-14 07:46:52,205 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 613 632) the Hoare annotation is: true [2022-12-14 07:46:52,206 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse19 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse20 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse23 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse24 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse25 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse26 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse14 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse27 (= |ULTIMATE.start_sll_update_at_~data#1| .cse10)) (.cse28 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse29 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse13 (= |#NULL.offset| 0)) (.cse15 (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse16 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse30 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse31 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse32 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse33 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse17 (<= 0 |#StackHeapBarrier|)) (.cse18 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse34 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse21 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse22 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse7 .cse8 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|) .cse9 (= .cse10 |ULTIMATE.start_main_~new_data~0#1|) .cse11 .cse12 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse13 (= .cse14 (+ |ULTIMATE.start_sll_update_at_~data#1| 1)) .cse15 .cse16 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse17 .cse18 .cse19 (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse20 .cse21 .cse22) (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse23 .cse0 .cse24 .cse1 .cse2 (not .cse16) .cse3 .cse4 .cse25 .cse5 .cse26 .cse6 .cse27 .cse28 (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse7 .cse29 .cse8 .cse9 .cse11 .cse13 .cse30 .cse31 .cse32 .cse33 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse17 .cse18 .cse19 .cse20 .cse34 .cse21 .cse22) (let ((.cse35 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse37 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|))) (and .cse23 .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse26 (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse36 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |#memory_int| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| (store .cse35 |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |ULTIMATE.start_main_~s~0#1.base|) .cse36)) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| (store .cse37 |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |ULTIMATE.start_main_~s~0#1.base|) .cse36))) 1) .cse14)) .cse6 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse27 .cse28 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse30 .cse31 .cse32 .cse33 .cse17 .cse18 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select .cse35 4)) (select .cse37 4))) .cse34 .cse21 .cse22))))) [2022-12-14 07:46:52,206 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-12-14 07:46:52,206 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 07:46:52,206 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse44 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse45 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) (.cse43 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse43)) (.cse18 (= (* |ULTIMATE.start_main_~len~0#1| 2) (+ 2 |ULTIMATE.start_sll_update_at_~data#1|))) (.cse19 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse26 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse45))) (.cse30 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| .cse45) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)))) (.cse34 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse35 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse3 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse4 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse42 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse5 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse37 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse11 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse38 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse39 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse15 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse20 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse21 (<= .cse44 |ULTIMATE.start_main_~len~0#1|)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse25 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse40 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse27 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse28 (<= 0 |#StackHeapBarrier|)) (.cse29 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse41 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse31 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse32 (<= |ULTIMATE.start_main_~len~0#1| .cse44)) (.cse33 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (+ (* (div (+ (let ((.cse17 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse17)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse17))) 1) (- 2)) 2) |ULTIMATE.start_main_~expected~0#1| 1) 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse18 .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse23 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse24 .cse25 .cse26 .cse27 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse28 .cse29 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse30 .cse31 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse32 .cse33) (let ((.cse36 (+ .cse42 1))) (and .cse34 .cse35 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (+ (* 2 (div .cse36 (- 2))) |ULTIMATE.start_main_~expected~0#1| 1) 0) .cse10 .cse37 (= (mod .cse36 2) 0) .cse11 .cse38 .cse39 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse40 .cse27 .cse28 .cse29 .cse41 .cse30 .cse31 .cse32 .cse33)) (and .cse34 (<= 2 .cse42) .cse35 .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse42 2) .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~len~0#1| .cse43) .cse8 .cse9 .cse10 .cse37 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse11 .cse38 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse39 .cse12 .cse14 .cse15 .cse16 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse40 .cse27 .cse28 .cse29 .cse41 .cse31 .cse32 .cse33)))) [2022-12-14 07:46:52,206 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_node_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse17 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (= |#NULL.base| 0))) (or (and .cse0 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_create_~len#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-12-14 07:46:52,206 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-12-14 07:46:52,206 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse32 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse35 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse7 (select .cse31 .cse35)) (.cse22 (select .cse32 .cse35)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse10 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse12 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse16 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse21 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse23 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse24 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse25 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse28 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse3 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse8 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse11 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse13 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse15 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse18 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse19 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse20 (= |#NULL.offset| 0)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse33 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse29 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse30 (= |#NULL.base| 0))) (or (let ((.cse5 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse4 (select (select |#memory_int| (select .cse31 4)) (select .cse32 4)))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 .cse5) .cse6 (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse7) .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse11 .cse12 .cse13 (not (= .cse7 |ULTIMATE.start_main_~s~0#1.base|)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= .cse21 (+ |ULTIMATE.start_sll_update_at_~data#1| 1)) (<= .cse5 .cse4) (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)) (let ((.cse34 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and .cse0 (= .cse21 (+ (select (select |#memory_int| .cse7) .cse22) 1)) .cse1 .cse2 .cse3 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse33 0) .cse15 .cse16 .cse17 .cse18 (= .cse21 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|)) .cse19 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse34 |ULTIMATE.start_main_~len~0#1|) .cse20 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse23 .cse24 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse25 .cse26 .cse27 .cse28 .cse29 (<= |ULTIMATE.start_main_~len~0#1| .cse34) .cse30)) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse1 .cse3 .cse6 .cse8 .cse9 .cse11 .cse13 .cse15 .cse17 .cse18 .cse19 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse20 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse26 .cse27 (= |ULTIMATE.start_main_~len~0#1| .cse33) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse29 .cse30)))) [2022-12-14 07:46:52,207 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse15 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_create_~len#1|) .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse15 .cse16))) [2022-12-14 07:46:52,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-12-14 07:46:52,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 07:46:52,207 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 613 632) the Hoare annotation is: false [2022-12-14 07:46:52,209 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2022-12-14 07:46:52,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 07:46:52,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,227 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,228 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,229 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,230 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,232 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,233 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,234 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,236 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,237 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,239 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,240 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,241 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,243 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,244 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-12-14 07:46:52,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,245 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,246 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-12-14 07:46:52,247 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,248 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-12-14 07:46:52,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,248 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:46:52 BoogieIcfgContainer [2022-12-14 07:46:52,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 07:46:52,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 07:46:52,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 07:46:52,250 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 07:46:52,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:21" (3/4) ... [2022-12-14 07:46:52,252 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 07:46:52,259 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-12-14 07:46:52,259 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-12-14 07:46:52,259 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 07:46:52,259 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 07:46:52,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && len == len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) [2022-12-14 07:46:52,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((data == \old(data) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && len == len) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) [2022-12-14 07:46:52,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && 1 <= \old(data)) && head == #memory_$Pointer$[s][s + 4]) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && len * 2 == data + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == #memory_$Pointer$[s][s + 4]) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((\old(data) <= 3 && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && i + 1 <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) [2022-12-14 07:46:52,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && i <= 0) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-12-14 07:46:52,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && head == s) && head == head) && data == 1) && data <= 1) && data == \old(data)) && \old(len) <= 2) && len + i == new_data) && len == 2) && s == head) && \result == head) && #NULL == 0) && len * 2 == data + 1) && index == i) && head == s) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && \old(index) == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((head == #memory_$Pointer$[s][4] && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && !(head == s)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == len + i) && index <= 1) && head == #memory_$Pointer$[s][4]) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[head := v_ArrVal_404][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_403]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_400]][s][s + 4]] + 1 <= len * 2)) && 1 <= data) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && #NULL == 0) [2022-12-14 07:46:52,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && \old(index) == i) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && (unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2 * 2 + expected + 1 == 0) && head == s) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && head == 0) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && (unknown-#memory_int-unknown[head][head] + 1) % 2 == 0) && index <= 0) && 0 <= i) && index <= 1) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && unknown-#memory_int-unknown[head][head] <= 2) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && 2 == expected) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-12-14 07:46:52,283 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 07:46:52,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 07:46:52,284 INFO L158 Benchmark]: Toolchain (without parser) took 31674.10ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 94.7MB in the beginning and 60.8MB in the end (delta: 33.9MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2022-12-14 07:46:52,284 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:46:52,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.37ms. Allocated memory is still 138.4MB. Free memory was 94.7MB in the beginning and 77.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 07:46:52,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.33ms. Allocated memory is still 138.4MB. Free memory was 77.3MB in the beginning and 75.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:46:52,285 INFO L158 Benchmark]: Boogie Preprocessor took 21.59ms. Allocated memory is still 138.4MB. Free memory was 75.2MB in the beginning and 73.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:46:52,285 INFO L158 Benchmark]: RCFGBuilder took 345.22ms. Allocated memory is still 138.4MB. Free memory was 73.8MB in the beginning and 55.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 07:46:52,285 INFO L158 Benchmark]: TraceAbstraction took 30958.74ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 54.9MB in the beginning and 64.0MB in the end (delta: -9.0MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2022-12-14 07:46:52,285 INFO L158 Benchmark]: Witness Printer took 34.12ms. Allocated memory is still 201.3MB. Free memory was 64.0MB in the beginning and 60.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:46:52,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.37ms. Allocated memory is still 138.4MB. Free memory was 94.7MB in the beginning and 77.8MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.33ms. Allocated memory is still 138.4MB. Free memory was 77.3MB in the beginning and 75.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.59ms. Allocated memory is still 138.4MB. Free memory was 75.2MB in the beginning and 73.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.22ms. Allocated memory is still 138.4MB. Free memory was 73.8MB in the beginning and 55.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30958.74ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 54.9MB in the beginning and 64.0MB in the end (delta: -9.0MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 34.12ms. Allocated memory is still 201.3MB. Free memory was 64.0MB in the beginning and 60.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1144 IncrementalHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 58 mSDtfsCounter, 1144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 345 SyntacticMatches, 30 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1837 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=8, InterpolantAutomatonStates: 104, 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, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 28 NumberOfFragments, 1929 HoareAnnotationTreeSize, 10 FomulaSimplifications, 645 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 10 FomulaSimplificationsInter, 8171 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 373 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 512 ConstructedInterpolants, 1 QuantifiedInterpolants, 2745 SizeOfPredicates, 87 NumberOfNonLiveVariables, 2561 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 241/343 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 4.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 47, TOOLS_POST_TIME: 3.8s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 3.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 100, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 3.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 13, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, 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: 298, DAG_COMPRESSION_RETAINED_NODES: 91, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2022-12-14 07:46:52,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && i <= 0) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((data == \old(data) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && len == len) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2022-12-14 07:46:52,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && len == len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-12-14 07:46:52,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,300 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && 1 <= \old(data)) && head == #memory_$Pointer$[s][s + 4]) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && len * 2 == data + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == #memory_$Pointer$[s][s + 4]) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((\old(data) <= 3 && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && i + 1 <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) - InvariantResult [Line: 600]: Loop Invariant [2022-12-14 07:46:52,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && \old(index) == i) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && (unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2 * 2 + expected + 1 == 0) && head == s) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && head == 0) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && (unknown-#memory_int-unknown[head][head] + 1) % 2 == 0) && index <= 0) && 0 <= i) && index <= 1) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && head <= 0) && data <= 1) && \old(len) <= 2) && len * 2 == 2 + data) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && unknown-#memory_int-unknown[head][head] <= 2) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && 2 == expected) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-12-14 07:46:52,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-12-14 07:46:52,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-12-14 07:46:52,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-12-14 07:46:52,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-12-14 07:46:52,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,322 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-12-14 07:46:52,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 07:46:52,322 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-12-14 07:46:52,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 07:46:52,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && head == s) && head == head) && data == 1) && data <= 1) && data == \old(data)) && \old(len) <= 2) && len + i == new_data) && len == 2) && s == head) && \result == head) && #NULL == 0) && len * 2 == data + 1) && index == i) && head == s) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && \old(index) == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((head == #memory_$Pointer$[s][4] && \old(data) <= 3) && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && !(head == s)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == len + i) && index <= 1) && head == #memory_$Pointer$[s][4]) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[head := v_ArrVal_404][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_403]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_400]][s][s + 4]] + 1 <= len * 2)) && 1 <= data) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-12-14 07:46:52,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad8c90e5-2105-43ff-91b4-29d36837c64f/bin/utaipan-gh47qXpMRh/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