./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/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_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 02:15:10,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:15:10,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:15:10,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:15:10,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:15:10,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:15:10,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:15:10,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:15:10,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:15:10,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:15:10,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:15:10,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:15:10,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:15:10,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:15:10,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:15:10,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:15:10,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:15:10,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:15:10,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:15:10,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:15:10,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:15:10,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:15:10,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:15:10,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:15:10,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:15:10,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:15:10,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:15:10,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:15:10,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:15:10,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:15:10,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:15:10,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:15:10,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:15:10,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:15:10,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:15:10,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:15:10,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:15:10,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:15:10,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:15:10,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:15:10,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:15:10,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:15:10,517 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:15:10,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:15:10,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:15:10,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:15:10,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:15:10,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:15:10,520 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:15:10,520 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:15:10,520 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:15:10,521 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:15:10,521 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:15:10,526 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:15:10,526 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:15:10,526 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:15:10,527 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:15:10,527 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:15:10,528 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:15:10,528 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:15:10,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:15:10,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:15:10,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:15:10,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:15:10,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:15:10,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:15:10,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:15:10,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:15:10,531 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:15:10,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:15:10,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:15:10,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:15:10,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:15:10,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:15:10,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:10,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:15:10,534 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:15:10,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:15:10,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:15:10,535 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:15:10,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:15:10,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:15:10,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:15:10,536 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_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/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_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI 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-11-03 02:15:10,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:15:11,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:15:11,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:15:11,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:15:11,027 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:15:11,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-03 02:15:11,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/data/a83433827/aa1ce92fdbfd47aa85cbc6c5b50969c0/FLAGf875d98b6 [2022-11-03 02:15:11,836 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:15:11,837 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-03 02:15:11,851 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/data/a83433827/aa1ce92fdbfd47aa85cbc6c5b50969c0/FLAGf875d98b6 [2022-11-03 02:15:12,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/data/a83433827/aa1ce92fdbfd47aa85cbc6c5b50969c0 [2022-11-03 02:15:12,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:15:12,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:15:12,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:12,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:15:12,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:15:12,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afb5ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12, skipping insertion in model container [2022-11-03 02:15:12,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:15:12,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:15:12,751 WARN L230 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_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-03 02:15:12,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:12,773 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:15:12,834 WARN L230 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_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-03 02:15:12,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:12,878 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:15:12,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12 WrapperNode [2022-11-03 02:15:12,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:12,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:12,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:15:12,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:15:12,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,957 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-11-03 02:15:12,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:12,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:15:12,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:15:12,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:15:12,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,990 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:12,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:15:12,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:15:12,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:15:12,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:15:13,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (1/1) ... [2022-11-03 02:15:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:13,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:13,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:15:13,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:15:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:15:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:15:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:15:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:15:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:15:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:15:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:15:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:15:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:15:13,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:15:13,251 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:15:13,254 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:15:13,545 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:15:13,691 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:15:13,691 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-03 02:15:13,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:13 BoogieIcfgContainer [2022-11-03 02:15:13,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:15:13,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:15:13,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:15:13,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:15:13,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:15:12" (1/3) ... [2022-11-03 02:15:13,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1beb4fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:13, skipping insertion in model container [2022-11-03 02:15:13,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:12" (2/3) ... [2022-11-03 02:15:13,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1beb4fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:13, skipping insertion in model container [2022-11-03 02:15:13,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:13" (3/3) ... [2022-11-03 02:15:13,718 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-03 02:15:13,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:15:13,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:15:13,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:15:13,802 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;@6cf15c3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:15:13,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:15:13,813 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-11-03 02:15:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:15:13,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:13,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:13,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1963659983, now seen corresponding path program 1 times [2022-11-03 02:15:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:13,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280855800] [2022-11-03 02:15:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:14,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280855800] [2022-11-03 02:15:14,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280855800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:14,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:14,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:15:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706266916] [2022-11-03 02:15:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:14,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:15:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:15:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:14,377 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-11-03 02:15:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:14,482 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-11-03 02:15:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:15:14,487 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-11-03 02:15:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:14,496 INFO L225 Difference]: With dead ends: 27 [2022-11-03 02:15:14,497 INFO L226 Difference]: Without dead ends: 12 [2022-11-03 02:15:14,501 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-11-03 02:15:14,507 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:14,509 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.1s Time] [2022-11-03 02:15:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-03 02:15:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-03 02:15:14,549 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-11-03 02:15:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-11-03 02:15:14,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2022-11-03 02:15:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:14,555 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-11-03 02:15:14,556 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-11-03 02:15:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-11-03 02:15:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:15:14,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:14,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:14,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:15:14,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:14,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1491156930, now seen corresponding path program 1 times [2022-11-03 02:15:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:14,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819684273] [2022-11-03 02:15:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:14,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:14,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819684273] [2022-11-03 02:15:14,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819684273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:14,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636297778] [2022-11-03 02:15:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:14,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:14,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:14,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:15:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:14,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:15:14,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:15,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:15,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636297778] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:15,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200564859] [2022-11-03 02:15:15,069 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-03 02:15:15,069 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:15,074 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:15,081 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:15,082 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:15,263 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:15:15,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:15,364 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:15,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:15,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:15,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:15,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:15,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:15,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:15,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:15,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:15,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:15,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:15,953 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:15:15,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:16,037 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:15:16,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:16,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:16,666 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:16,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:16,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:16,753 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:15:16,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:16,894 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:16,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:16,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:16,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:16,971 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:15:16,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:17,055 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:17,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:17,134 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:17,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:17,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:17,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:17,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:17,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:17,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:17,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:17,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:17,723 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:18,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1200564859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:18,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:18,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-03 02:15:18,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254990637] [2022-11-03 02:15:18,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:18,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:15:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:15:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:15:18,078 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-11-03 02:15:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:18,166 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-11-03 02:15:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:15:18,167 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-11-03 02:15:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:18,168 INFO L225 Difference]: With dead ends: 18 [2022-11-03 02:15:18,168 INFO L226 Difference]: Without dead ends: 13 [2022-11-03 02:15:18,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:15:18,177 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:18,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-03 02:15:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-11-03 02:15:18,192 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-11-03 02:15:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-03 02:15:18,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-03 02:15:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:18,195 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-03 02:15:18,195 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-11-03 02:15:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-03 02:15:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:15:18,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:18,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:18,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:18,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:18,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1766738179, now seen corresponding path program 1 times [2022-11-03 02:15:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:18,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327766815] [2022-11-03 02:15:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:15:18,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327766815] [2022-11-03 02:15:18,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327766815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:18,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520363666] [2022-11-03 02:15:18,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:18,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:18,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:18,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:18,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:15:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:18,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:15:18,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:15:18,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:15:18,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520363666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925579518] [2022-11-03 02:15:18,704 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:18,704 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:18,705 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:18,705 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:18,705 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:18,786 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:18,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:18,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:18,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:18,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:18,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:18,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:18,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:18,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:18,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:18,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:18,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:18,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:18,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,102 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:15:19,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,152 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:15:19,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:19,595 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:19,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:19,657 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:15:19,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:19,803 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:19,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:19,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:19,862 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:15:19,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:19,929 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:19,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:19,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:19,993 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:19,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:20,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:20,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:20,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:20,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:20,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:20,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:20,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,508 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:20,513 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:20,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:20,549 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:20,553 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:20,557 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:20,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:20,599 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:21,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1925579518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:21,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:21,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2022-11-03 02:15:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831757821] [2022-11-03 02:15:21,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:21,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:15:21,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:15:21,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:15:21,068 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-11-03 02:15:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:21,179 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2022-11-03 02:15:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:15:21,180 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-11-03 02:15:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:21,181 INFO L225 Difference]: With dead ends: 21 [2022-11-03 02:15:21,181 INFO L226 Difference]: Without dead ends: 14 [2022-11-03 02:15:21,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:15:21,188 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:21,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 13 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-03 02:15:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-03 02:15:21,199 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-11-03 02:15:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-11-03 02:15:21,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2022-11-03 02:15:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:21,200 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-11-03 02:15:21,200 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-11-03 02:15:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-11-03 02:15:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:15:21,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:21,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:21,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:21,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:21,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash 446479962, now seen corresponding path program 1 times [2022-11-03 02:15:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:21,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453304601] [2022-11-03 02:15:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:15:21,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:21,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453304601] [2022-11-03 02:15:21,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453304601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:21,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910621647] [2022-11-03 02:15:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:21,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:21,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:21,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:21,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:15:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:21,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:15:21,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:15:21,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:15:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910621647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:21,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1444091249] [2022-11-03 02:15:21,739 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:21,739 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:21,739 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:21,740 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:21,740 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:21,796 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:21,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:21,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:21,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:21,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:21,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:21,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:21,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:21,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:21,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:21,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:21,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:21,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:21,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:22,113 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:15:22,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:22,170 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:15:22,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:22,658 INFO L356 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-03 02:15:22,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:22,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:22,843 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:22,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:22,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:23,000 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:23,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:23,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:23,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:23,113 INFO L356 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-03 02:15:23,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:23,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:23,200 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:23,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:23,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:23,292 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:23,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:24,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:24,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:24,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:24,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:24,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:24,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:24,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,499 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:24,502 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:24,506 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:24,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:24,984 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:25,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1444091249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:25,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:25,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-03 02:15:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616980026] [2022-11-03 02:15:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:25,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:15:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:15:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:15:25,685 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-11-03 02:15:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:26,227 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-11-03 02:15:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:15:26,228 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-11-03 02:15:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:26,229 INFO L225 Difference]: With dead ends: 25 [2022-11-03 02:15:26,229 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:15:26,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:15:26,230 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:26,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:15:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-11-03 02:15:26,242 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-11-03 02:15:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-03 02:15:26,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2022-11-03 02:15:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:26,243 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-03 02:15:26,243 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-11-03 02:15:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-03 02:15:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:15:26,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:26,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:26,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:26,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:26,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 954324368, now seen corresponding path program 1 times [2022-11-03 02:15:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:26,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676957191] [2022-11-03 02:15:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:26,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:15:26,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:26,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676957191] [2022-11-03 02:15:26,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676957191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:26,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660072130] [2022-11-03 02:15:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:26,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:26,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:26,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:26,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:15:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:26,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:15:26,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:15:26,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:15:26,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660072130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:26,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1929060477] [2022-11-03 02:15:26,778 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:26,779 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:26,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:26,779 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:26,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:26,837 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:15:26,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:26,882 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:26,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:26,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:26,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:26,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:26,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:26,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:26,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:26,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:26,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,152 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:15:27,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,202 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:15:27,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:27,570 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:15:27,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:27,717 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:27,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:27,822 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:27,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:27,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:27,875 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:15:27,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:27,948 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:27,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:27,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:28,004 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:28,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:28,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:28,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:28,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:28,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:28,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:28,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:28,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,742 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:28,746 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:28,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:28,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:28,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:29,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:29,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:29,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:29,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:29,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:29,257 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:30,152 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-11-03 02:15:30,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:30,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:30,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-03 02:15:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713702783] [2022-11-03 02:15:30,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:30,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:15:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:15:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:15:30,155 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-11-03 02:15:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:30,197 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-11-03 02:15:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:15:30,198 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-11-03 02:15:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:30,198 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:15:30,198 INFO L226 Difference]: Without dead ends: 17 [2022-11-03 02:15:30,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:15:30,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:30,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:15:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-03 02:15:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-03 02:15:30,212 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-11-03 02:15:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-03 02:15:30,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-11-03 02:15:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:30,213 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-03 02:15:30,213 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-11-03 02:15:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-03 02:15:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:15:30,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:30,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:30,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:30,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:30,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -694979649, now seen corresponding path program 2 times [2022-11-03 02:15:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634066293] [2022-11-03 02:15:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:15:30,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:30,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634066293] [2022-11-03 02:15:30,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634066293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:30,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724506888] [2022-11-03 02:15:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:15:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:30,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:30,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:15:30,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:15:30,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:30,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:15:30,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:15:30,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:15:30,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724506888] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:30,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [898886355] [2022-11-03 02:15:30,713 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:30,714 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:30,714 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:30,714 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:30,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:30,765 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:15:30,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:30,838 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:30,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:30,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:30,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:30,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:30,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:30,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:30,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:30,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:30,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:30,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:30,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:30,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,088 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:15:31,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,144 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:15:31,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:31,361 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:15:31,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:31,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:31,441 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:15:31,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:31,568 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:31,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:31,657 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:31,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:31,744 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:31,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:31,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:31,837 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:31,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:32,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:32,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:32,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:32,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:32,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:32,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:32,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,210 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:32,212 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:32,216 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:32,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:32,679 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:33,386 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '732#(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-11-03 02:15:33,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:33,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:33,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-03 02:15:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492883051] [2022-11-03 02:15:33,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:33,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:15:33,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:15:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:15:33,389 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-03 02:15:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:33,479 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-11-03 02:15:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:15:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-03 02:15:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:33,480 INFO L225 Difference]: With dead ends: 31 [2022-11-03 02:15:33,480 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:15:33,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:15:33,482 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 55 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:33,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 14 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:15:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-11-03 02:15:33,491 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-11-03 02:15:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-03 02:15:33,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2022-11-03 02:15:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:33,492 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-03 02:15:33,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-03 02:15:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-03 02:15:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:15:33,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:33,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:33,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:33,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:33,714 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:33,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:33,714 INFO L85 PathProgramCache]: Analyzing trace with hash 706001952, now seen corresponding path program 3 times [2022-11-03 02:15:33,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:33,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973399911] [2022-11-03 02:15:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:33,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:35,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973399911] [2022-11-03 02:15:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973399911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438264838] [2022-11-03 02:15:35,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:15:35,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:35,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:35,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:15:36,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:15:36,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:36,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-03 02:15:36,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:36,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,271 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:15:36,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,465 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:15:36,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:36,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:36,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:15:36,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:37,106 WARN L833 $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-11-03 02:15:37,144 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse1)) (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse1))) .cse3)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= .cse3 (+ 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse1)) (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse1))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))))) is different from false [2022-11-03 02:15:37,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:15:37,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-03 02:15:37,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:15:37,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 101 [2022-11-03 02:15:37,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2022-11-03 02:15:37,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:15:37,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-03 02:15:37,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:15:37,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 101 [2022-11-03 02:15:37,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2022-11-03 02:15:37,361 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_400 Int) (v_ArrVal_397 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse2) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse2)))))) (<= .cse1 .cse0))) is different from false [2022-11-03 02:15:37,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:15:37,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 58 [2022-11-03 02:15:37,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:37,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:15:37,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:37,435 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 02:15:37,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-03 02:15:37,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:37,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:15:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 02:15:37,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438264838] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:37,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [465314118] [2022-11-03 02:15:37,645 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:37,645 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:37,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:37,645 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:37,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:37,700 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:15:37,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:37,780 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:37,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:37,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:37,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:37,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:37,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:37,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:37,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:37,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:37,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:37,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:37,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:37,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,115 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:15:38,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,166 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:15:38,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:38,485 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:15:38,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:38,634 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:38,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:38,706 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:15:38,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:38,824 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:38,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:38,879 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:38,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:38,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:38,942 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:38,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:39,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:39,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:39,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:39,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:39,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:39,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:39,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,379 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:39,383 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:39,387 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:39,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:39,903 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:41,690 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '969#(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-11-03 02:15:41,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:41,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:41,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 39 [2022-11-03 02:15:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559817936] [2022-11-03 02:15:41,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:41,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 02:15:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:41,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 02:15:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1735, Unknown=3, NotChecked=258, Total=2162 [2022-11-03 02:15:41,695 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-11-03 02:15:43,238 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse0 .cse1) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_400 Int) (v_ArrVal_397 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse2) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse2)))))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= .cse1 .cse0) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| 2) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-03 02:15:43,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse3 4)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse6 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select (select |c_#memory_int| .cse0) (select .cse5 4))) (.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse4)) (select (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse4))) .cse6)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= .cse6 (+ 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse4)) (select (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= .cse2 .cse1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from false [2022-11-03 02:15:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:44,236 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-11-03 02:15:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:15:44,237 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-11-03 02:15:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:44,240 INFO L225 Difference]: With dead ends: 41 [2022-11-03 02:15:44,240 INFO L226 Difference]: Without dead ends: 39 [2022-11-03 02:15:44,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=346, Invalid=2861, Unknown=5, NotChecked=570, Total=3782 [2022-11-03 02:15:44,243 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:44,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 86 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 367 Invalid, 0 Unknown, 79 Unchecked, 0.5s Time] [2022-11-03 02:15:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-03 02:15:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-11-03 02:15:44,266 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-11-03 02:15:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-03 02:15:44,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-11-03 02:15:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:44,271 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-03 02:15:44,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-11-03 02:15:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-03 02:15:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:15:44,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:44,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:44,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:44,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:15:44,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash 409571466, now seen corresponding path program 4 times [2022-11-03 02:15:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:44,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505937778] [2022-11-03 02:15:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:15:44,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:44,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505937778] [2022-11-03 02:15:44,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505937778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:44,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:44,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:15:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494545659] [2022-11-03 02:15:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:15:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:44,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:15:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:15:44,673 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-11-03 02:15:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:44,751 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-03 02:15:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:15:44,753 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-11-03 02:15:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:44,754 INFO L225 Difference]: With dead ends: 33 [2022-11-03 02:15:44,754 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 02:15:44,754 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-11-03 02:15:44,755 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:44,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:15:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 02:15:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-03 02:15:44,777 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-11-03 02:15:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-03 02:15:44,778 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-11-03 02:15:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:44,779 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-03 02:15:44,779 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-11-03 02:15:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-03 02:15:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:15:44,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:44,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:44,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:15:44,781 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1554881251, now seen corresponding path program 5 times [2022-11-03 02:15:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:44,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826026257] [2022-11-03 02:15:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:15:44,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:44,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826026257] [2022-11-03 02:15:44,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826026257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:44,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643122171] [2022-11-03 02:15:44,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:15:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:44,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:44,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:15:45,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:15:45,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:45,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:15:45,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:15:45,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:15:45,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643122171] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:45,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:15:45,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-11-03 02:15:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983440328] [2022-11-03 02:15:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:45,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:15:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:45,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:15:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:15:45,359 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-11-03 02:15:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:45,460 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-11-03 02:15:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:15:45,461 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-11-03 02:15:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:45,462 INFO L225 Difference]: With dead ends: 42 [2022-11-03 02:15:45,462 INFO L226 Difference]: Without dead ends: 34 [2022-11-03 02:15:45,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:15:45,464 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:45,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-03 02:15:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-03 02:15:45,483 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-11-03 02:15:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-03 02:15:45,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-11-03 02:15:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:45,484 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-03 02:15:45,485 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-11-03 02:15:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-03 02:15:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:15:45,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:45,486 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:45,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:45,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:45,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 823590399, now seen corresponding path program 6 times [2022-11-03 02:15:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:45,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101617048] [2022-11-03 02:15:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:45,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:15:45,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:45,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101617048] [2022-11-03 02:15:45,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101617048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:45,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614780306] [2022-11-03 02:15:45,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:15:45,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:45,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:45,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:45,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:15:46,015 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:15:46,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:46,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:15:46,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:15:46,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:15:46,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614780306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:46,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [120157925] [2022-11-03 02:15:46,149 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:46,149 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:46,149 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:46,149 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:46,150 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:46,198 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:15:46,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,248 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:46,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:46,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:46,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:46,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:46,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:46,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:46,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:46,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,461 INFO L356 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-03 02:15:46,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,594 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-03 02:15:46,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:46,966 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:46,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,136 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:47,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,190 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:15:47,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,270 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:47,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:47,329 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:47,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:47,389 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:47,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:47,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:47,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:47,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:47,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:47,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,798 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:47,801 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:47,805 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:47,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:47,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:48,288 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:49,205 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1612#(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-11-03 02:15:49,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:49,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:49,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2022-11-03 02:15:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888383861] [2022-11-03 02:15:49,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:49,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:15:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:15:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:15:49,208 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-11-03 02:15:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:49,483 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-11-03 02:15:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:15:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-11-03 02:15:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:49,484 INFO L225 Difference]: With dead ends: 53 [2022-11-03 02:15:49,484 INFO L226 Difference]: Without dead ends: 41 [2022-11-03 02:15:49,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-11-03 02:15:49,486 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:49,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 37 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-03 02:15:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-03 02:15:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-11-03 02:15:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-03 02:15:49,506 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2022-11-03 02:15:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:49,506 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-03 02:15:49,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-11-03 02:15:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-03 02:15:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:15:49,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:49,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:49,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:49,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:49,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 74992768, now seen corresponding path program 1 times [2022-11-03 02:15:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:49,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433908357] [2022-11-03 02:15:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:15:50,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433908357] [2022-11-03 02:15:50,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433908357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:50,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453816532] [2022-11-03 02:15:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:50,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:50,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:50,234 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:50,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:15:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:50,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:15:50,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:50,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:50,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:15:50,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:50,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:50,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:50,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:15:50,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453816532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:50,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1887433193] [2022-11-03 02:15:50,993 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:50,993 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:50,994 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:50,994 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:50,994 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:51,045 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:15:51,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,099 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:51,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:51,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:51,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:51,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,325 INFO L356 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-03 02:15:51,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,417 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-03 02:15:51,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,694 INFO L356 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-03 02:15:51,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:51,842 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:51,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,008 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:52,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,138 INFO L356 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-03 02:15:52,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:52,215 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:52,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:52,273 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:52,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:52,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:52,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:52,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:52,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:52,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,607 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:52,613 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:52,615 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:52,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:52,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:53,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:53,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:53,287 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:54,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1930#(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-11-03 02:15:54,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:54,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:54,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2022-11-03 02:15:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948625503] [2022-11-03 02:15:54,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:54,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 02:15:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:54,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 02:15:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:15:54,205 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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-11-03 02:15:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:54,940 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-11-03 02:15:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:15:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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-11-03 02:15:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:54,942 INFO L225 Difference]: With dead ends: 44 [2022-11-03 02:15:54,942 INFO L226 Difference]: Without dead ends: 42 [2022-11-03 02:15:54,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 02:15:54,943 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 80 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:54,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 78 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:15:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-03 02:15:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-03 02:15:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-11-03 02:15:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-03 02:15:54,978 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 20 [2022-11-03 02:15:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:54,978 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-03 02:15:54,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 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-11-03 02:15:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-03 02:15:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:15:54,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:54,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:55,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:55,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:15:55,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1025716738, now seen corresponding path program 7 times [2022-11-03 02:15:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282140625] [2022-11-03 02:15:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:55,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:15:55,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:55,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282140625] [2022-11-03 02:15:55,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282140625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:55,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816205047] [2022-11-03 02:15:55,302 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:15:55,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:55,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:55,304 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:55,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:15:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:55,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:15:55,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:15:55,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:15:55,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816205047] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:55,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [209784893] [2022-11-03 02:15:55,611 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:55,611 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:55,611 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:55,611 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:55,612 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:55,665 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:55,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:55,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:55,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:55,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:55,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:55,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:55,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:55,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,886 INFO L356 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-03 02:15:55,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:55,983 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-03 02:15:55,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:56,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,348 INFO L356 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-03 02:15:56,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:56,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,524 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:56,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:56,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,651 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:15:56,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:56,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:56,778 INFO L356 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-03 02:15:56,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:56,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:56,841 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:56,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:56,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:56,922 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:15:56,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:57,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:57,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:57,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:57,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:57,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:57,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:15:57,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,332 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:57,335 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:57,337 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:15:57,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:57,809 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:58,982 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2220#(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-11-03 02:15:58,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:15:58,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:58,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-03 02:15:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418376246] [2022-11-03 02:15:58,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:58,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:15:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:58,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:15:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:15:58,985 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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-11-03 02:15:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:59,137 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-03 02:15:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:15:59,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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-11-03 02:15:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:59,141 INFO L225 Difference]: With dead ends: 45 [2022-11-03 02:15:59,142 INFO L226 Difference]: Without dead ends: 22 [2022-11-03 02:15:59,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:15:59,144 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:59,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-03 02:15:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-03 02:15:59,183 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-11-03 02:15:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-11-03 02:15:59,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-11-03 02:15:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:59,185 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-11-03 02:15:59,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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-11-03 02:15:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-11-03 02:15:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:15:59,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:59,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:59,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:59,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:15:59,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:15:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1971844054, now seen corresponding path program 2 times [2022-11-03 02:15:59,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:59,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595875986] [2022-11-03 02:15:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:15:59,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:59,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595875986] [2022-11-03 02:15:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595875986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092517622] [2022-11-03 02:15:59,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:15:59,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:59,574 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:59,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:15:59,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:15:59,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:59,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:15:59,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:15:59,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:15:59,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092517622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:59,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1029805394] [2022-11-03 02:15:59,873 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 02:15:59,874 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:15:59,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:15:59,874 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:15:59,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:59,937 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:15:59,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:59,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:15:59,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:15:59,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,188 INFO L356 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-03 02:16:00,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,234 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:16:00,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,627 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:16:00,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,809 INFO L356 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-03 02:16:00,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,862 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:16:00,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 198 [2022-11-03 02:16:00,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:00,926 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:16:00,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:00,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:00,991 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:16:00,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:01,068 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-03 02:16:01,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:01,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:01,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:01,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:01,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:01,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:01,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:01,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,378 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:16:01,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:16:01,382 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:16:01,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:01,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:02,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:02,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 02:16:02,281 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:16:04,186 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2487#(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-11-03 02:16:04,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:16:04,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:04,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-03 02:16:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947942346] [2022-11-03 02:16:04,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:04,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:16:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:16:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:16:04,188 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-11-03 02:16:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:04,288 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-11-03 02:16:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:16:04,289 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-11-03 02:16:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:04,289 INFO L225 Difference]: With dead ends: 22 [2022-11-03 02:16:04,289 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:16:04,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:16:04,290 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:04,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:16:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:16:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:16:04,291 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-11-03 02:16:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:16:04,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-03 02:16:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:04,292 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:16:04,292 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-11-03 02:16:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:16:04,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:16:04,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:16:04,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:04,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:04,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:16:15,492 WARN L234 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 126 DAG size of output: 117 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:16:40,587 WARN L234 SmtUtils]: Spent 24.21s on a formula simplification. DAG size of input: 208 DAG size of output: 146 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:16:40,592 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-03 02:16:40,592 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse29 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.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 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse9 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse11 (= |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)) (.cse17 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse18 (<= .cse29 |ULTIMATE.start_main_~len~0#1|)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse21 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse22 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse23 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse25 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse26 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse27 (<= |ULTIMATE.start_main_~len~0#1| .cse29)) (.cse28 (= |#NULL.base| 0))) (or (let ((.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse12 (select (select |#memory_int| (select .cse10 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (select .cse10 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) .cse11 (<= .cse12 (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) .cse12) .cse20 .cse21 .cse22 .cse23 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse24 .cse25 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse26 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse27 .cse28))) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse26 .cse27 .cse28)))) [2022-11-03 02:16:40,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:16:40,592 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-03 02:16:40,593 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse35 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse21 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse11 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse23 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse33 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse34 (= (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)) (.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse13 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse9 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse14 (= |ULTIMATE.start_sll_update_at_~data#1| .cse35)) (.cse15 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse18 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse19 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse22 (= |#NULL.offset| 0)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse25 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse26 (<= |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|)) (.cse36 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse30 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse31 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse32 (= |#NULL.base| 0))) (or (let ((.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|))) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (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 .cse8 |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |ULTIMATE.start_main_~s~0#1.base|) .cse9)) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| (store .cse10 |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |ULTIMATE.start_main_~s~0#1.base|) .cse9)) 1) .cse11)) .cse12 .cse13 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select .cse8 4)) (select .cse10 4))) .cse30 .cse31 .cse32)) (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|) .cse33 .cse34 .cse2 .cse3 .cse4 .cse6 .cse12 (= |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|) .cse16 .cse18 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|) .cse19 (= .cse35 |ULTIMATE.start_main_~new_data~0#1|) .cse20 .cse21 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse22 (= .cse11 (+ |ULTIMATE.start_sll_update_at_~data#1| 1)) (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse23 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse28 .cse29 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse36 .cse31 .cse32) (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse0 .cse33 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~i~0#1| 1) .cse6 .cse7 .cse12 .cse13 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse9) |ULTIMATE.start_main_~s~0#1.base|))))) .cse14 .cse15 (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse28 .cse29 .cse36 .cse30 .cse31 .cse32)))) [2022-11-03 02:16:40,593 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-11-03 02:16:40,593 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse43 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse44 (select (select |#memory_int| (select .cse14 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4))) (.cse40 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse39 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse13 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse15 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse16 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse30 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse35 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse4 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse5 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse6 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse10 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse17 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse18 (<= .cse44 .cse40)) (.cse19 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse20 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse21 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse22 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse23 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse24 (<= .cse43 |ULTIMATE.start_main_~len~0#1|)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) .cse44)) (.cse27 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse28 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse29 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse31 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse32 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse36 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse37 (<= |ULTIMATE.start_main_~len~0#1| .cse43)) (.cse38 (= |#NULL.base| 0))) (or (let ((.cse11 (+ .cse39 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (+ (* 2 (div .cse11 (- 2))) |ULTIMATE.start_main_~expected~0#1| 1) 0) .cse12 .cse13 (= (mod .cse11 2) 0) (not (= (select .cse14 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)) (and .cse0 (<= 2 .cse39) .cse1 .cse3 .cse4 .cse5 (<= .cse39 2) .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| .cse40) .cse9 .cse10 .cse12 .cse13 (= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse15 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (let ((.cse42 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (let ((.cse41 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse42))) (and .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| .cse41)) .cse17 .cse18 .cse19 .cse20 .cse21 (= (+ (* (div (+ (select (select |#memory_int| .cse41) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse42)) 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|) .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse27 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse28 .cse29 .cse31 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) .cse32 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse33 .cse34 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse36 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse37 .cse38))))))) [2022-11-03 02:16:40,593 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-11-03 02:16:40,593 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 (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-03 02:16:40,593 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-03 02:16:40,594 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse33 (select .cse10 4)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse30 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse29 (select (select |#memory_int| .cse33) (select .cse12 4)))) (let ((.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse1 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse33))) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse15 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse20 (<= .cse30 .cse29)) (.cse21 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse22 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse23 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse26 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse9 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse14 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse17 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse18 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse19 (= |#NULL.offset| 0)) (.cse24 (<= 0 |#StackHeapBarrier|)) (.cse25 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse31 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse27 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse28 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_update_at_~data#1| 3) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse11 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store .cse10 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse11)) (select (store .cse12 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse11))) 1) (* |ULTIMATE.start_main_~len~0#1| 2))))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|) .cse0 .cse1 .cse2 (<= .cse29 .cse30) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 (<= .cse31 0) .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse32 |ULTIMATE.start_main_~len~0#1|) .cse19 .cse20 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= |ULTIMATE.start_main_~len~0#1| .cse32) .cse28)) (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|) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse3 .cse4 .cse5 .cse7 .cse9 .cse14 .cse16 .cse17 .cse18 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse19 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse24 .cse25 (= |ULTIMATE.start_main_~len~0#1| .cse31) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse27 .cse28)))))) [2022-11-03 02:16:40,594 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 (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .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-11-03 02:16:40,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-11-03 02:16:40,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:16:40,597 INFO L444 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2022-11-03 02:16:40,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:16:40,612 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,616 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,651 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,653 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,659 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,661 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,661 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,668 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,669 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,670 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,671 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,674 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,675 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,676 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,682 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,683 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,684 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,685 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,686 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,686 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-03 02:16:40,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,687 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,691 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,692 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-03 02:16:40,694 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,695 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:16:40 BoogieIcfgContainer [2022-11-03 02:16:40,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:16:40,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:16:40,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:16:40,699 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:16:40,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:13" (3/4) ... [2022-11-03 02:16:40,703 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:16:40,713 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-03 02:16:40,713 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-03 02:16:40,713 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 02:16:40,714 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:16:40,744 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) || (((((((((((((2 == len && 1 <= \old(data)) && \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)) && 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-11-03 02:16:40,745 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) || ((((((((((((((((((((2 == len && 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) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) [2022-11-03 02:16:40,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((i == 0 && \old(data) <= 3) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[s := v_ArrVal_404][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_400][s + 4]] + 1 <= len * 2))) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && 0 <= \result) && \old(index) <= 1) && 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-11-03 02:16:40,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(#memory_$Pointer$[s][s + 4] == s)) && 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 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) && 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) [2022-11-03 02:16:40,747 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((\old(data) <= 3 && 0 <= head) && 1 <= \old(data)) && i <= 0) && 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) && data <= 3) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && 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) || ((((((((((((((((((((((((((((((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)) && temp == 0) && \old(data) <= 1) && head <= 0) && i == 1) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_399 : [int]int, v_ArrVal_403 : int :: !(#memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4] == s)))) && 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)) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && s == 0) && #NULL == 0) [2022-11-03 02:16:40,748 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 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) && !(#memory_$Pointer$[s][s + 4] == s)) && 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 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) && 0 <= head) && 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) && 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)) || (((((((((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && \old(index) == i) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(head == #memory_$Pointer$[head][head + 4])) && 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && head == 0) && index + 1 <= i) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-11-03 02:16:40,766 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:16:40,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:16:40,767 INFO L158 Benchmark]: Toolchain (without parser) took 88639.74ms. Allocated memory was 109.1MB in the beginning and 415.2MB in the end (delta: 306.2MB). Free memory was 64.1MB in the beginning and 185.2MB in the end (delta: -121.0MB). Peak memory consumption was 184.3MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,767 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 109.1MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 55.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:16:40,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 747.79ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 76.5MB in the end (delta: -12.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.25ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,768 INFO L158 Benchmark]: Boogie Preprocessor took 35.89ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 72.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,769 INFO L158 Benchmark]: RCFGBuilder took 699.17ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 54.4MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,769 INFO L158 Benchmark]: TraceAbstraction took 86988.61ms. Allocated memory was 109.1MB in the beginning and 415.2MB in the end (delta: 306.2MB). Free memory was 53.7MB in the beginning and 189.4MB in the end (delta: -135.7MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,775 INFO L158 Benchmark]: Witness Printer took 68.45ms. Allocated memory is still 415.2MB. Free memory was 189.4MB in the beginning and 185.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:16:40,776 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.37ms. Allocated memory is still 109.1MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 55.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 747.79ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 76.5MB in the end (delta: -12.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.25ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.89ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 72.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 699.17ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 54.4MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 86988.61ms. Allocated memory was 109.1MB in the beginning and 415.2MB in the end (delta: 306.2MB). Free memory was 53.7MB in the beginning and 189.4MB in the end (delta: -135.7MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. * Witness Printer took 68.45ms. Allocated memory is still 415.2MB. Free memory was 189.4MB in the beginning and 185.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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$.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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,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$.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_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,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$.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$.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$.offset - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,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_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,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 * 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: 86.8s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 352 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 79 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 977 IncrementalHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 65 mSDtfsCounter, 977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 342 SyntacticMatches, 31 SemanticMatches, 230 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=10, 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 52 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 28 NumberOfFragments, 1872 HoareAnnotationTreeSize, 10 FomulaSimplifications, 540 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 10 FomulaSimplificationsInter, 14729 FormulaSimplificationTreeSizeReductionInter, 35.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 373 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 512 ConstructedInterpolants, 3 QuantifiedInterpolants, 2769 SizeOfPredicates, 87 NumberOfNonLiveVariables, 2561 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 246/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: 7.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 47, TOOLS_POST_TIME: 7.3s, 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: 7.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.8s, 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.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 7.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 7.4s, 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: 622]: Loop Invariant [2022-11-03 02:16:40,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(#memory_$Pointer$[s][s + 4] == s)) && 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && \old(data) <= 3) && 0 <= head) && 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) && 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) - 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) || ((((((((((((((((((((2 == len && 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) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2022-11-03 02:16:40,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,802 WARN L418 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) || (((((((((((((2 == len && 1 <= \old(data)) && \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)) && 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-11-03 02:16:40,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,814 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((i == 0 && \old(data) <= 3) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[s := v_ArrVal_404][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_400][s + 4]] + 1 <= len * 2))) && index <= 0) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && 0 <= \result) && \old(index) <= 1) && 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-11-03 02:16:40,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,821 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,824 WARN L418 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) && len == data) && \old(data) <= 3) && 0 <= head) && 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) && !(#memory_$Pointer$[s][s + 4] == s)) && 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 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) && 0 <= head) && 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) && 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)) || (((((((((((((((((((((((((((((((((((((((len == data && \old(data) <= 3) && 0 <= head) && \old(index) == i) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(head == #memory_$Pointer$[head][head + 4])) && 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) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && head == 0) && index + 1 <= i) && head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-11-03 02:16:40,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-03 02:16:40,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,832 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2022-11-03 02:16:40,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,832 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,833 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,834 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2022-11-03 02:16:40,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:16:40,835 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,835 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-03 02:16:40,836 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2022-11-03 02:16:40,836 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-03 02:16:40,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:16:40,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((\old(data) <= 3 && 0 <= head) && 1 <= \old(data)) && i <= 0) && 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) && data <= 3) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && 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) || ((((((((((((((((((((((((((((((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)) && temp == 0) && \old(data) <= 1) && head <= 0) && i == 1) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_399 : [int]int, v_ArrVal_403 : int :: !(#memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4] == s)))) && 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)) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-03 02:16:40,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b2e895-77f8-42ba-89bb-9c12c9f80c2d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE