./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/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_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/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_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- 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:46:04,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:46:04,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:46:04,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:46:04,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:46:04,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:46:04,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:46:04,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:46:04,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:46:04,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:46:04,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:46:04,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:46:04,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:46:04,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:46:05,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:46:05,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:46:05,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:46:05,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:46:05,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:46:05,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:46:05,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:46:05,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:46:05,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:46:05,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:46:05,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:46:05,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:46:05,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:46:05,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:46:05,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:46:05,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:46:05,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:46:05,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:46:05,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:46:05,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:46:05,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:46:05,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:46:05,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:46:05,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:46:05,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:46:05,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:46:05,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:46:05,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:46:05,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:46:05,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:46:05,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:46:05,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:46:05,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:46:05,056 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:46:05,056 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:46:05,056 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:46:05,056 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:46:05,057 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:46:05,057 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:46:05,057 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:46:05,058 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:46:05,058 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:46:05,058 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:46:05,059 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:46:05,059 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:46:05,059 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:46:05,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:46:05,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:46:05,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:46:05,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:46:05,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:46:05,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:46:05,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:46:05,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:46:05,063 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:46:05,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:46:05,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:46:05,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:46:05,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:46:05,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:46:05,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:46:05,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:46:05,065 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:46:05,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:46:05,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:46:05,066 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:46:05,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:46:05,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:46:05,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:46:05,067 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_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/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_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-03 02:46:05,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:46:05,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:46:05,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:46:05,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:46:05,375 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:46:05,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-03 02:46:05,454 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/data/42b9ed1c3/b9cf21b78d0c4495acab210a8587392f/FLAG28e49c746 [2022-11-03 02:46:05,936 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:46:05,936 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-03 02:46:05,953 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/data/42b9ed1c3/b9cf21b78d0c4495acab210a8587392f/FLAG28e49c746 [2022-11-03 02:46:06,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/data/42b9ed1c3/b9cf21b78d0c4495acab210a8587392f [2022-11-03 02:46:06,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:46:06,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:46:06,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:46:06,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:46:06,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:46:06,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:46:06" (1/1) ... [2022-11-03 02:46:06,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535f10f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:06, skipping insertion in model container [2022-11-03 02:46:06,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:46:06" (1/1) ... [2022-11-03 02:46:06,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:46:06,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:46:06,917 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_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-03 02:46:06,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:46:06,942 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:46:06,993 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_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-03 02:46:06,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:46:07,018 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:46:07,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07 WrapperNode [2022-11-03 02:46:07,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:46:07,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:46:07,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:46:07,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:46:07,030 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:46:07" (1/1) ... [2022-11-03 02:46:07,064 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:46:07" (1/1) ... [2022-11-03 02:46:07,101 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-11-03 02:46:07,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:46:07,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:46:07,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:46:07,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:46:07,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:46:07,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:46:07,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:46:07,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:46:07,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (1/1) ... [2022-11-03 02:46:07,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:46:07,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:46:07,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:46:07,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:46:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:46:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:46:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 02:46:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 02:46:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:46:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:46:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:46:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:46:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:46:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:46:07,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:46:07,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:46:07,363 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:46:07,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:46:07,632 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:46:07,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:46:07,753 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-03 02:46:07,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:46:07 BoogieIcfgContainer [2022-11-03 02:46:07,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:46:07,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:46:07,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:46:07,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:46:07,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:46:06" (1/3) ... [2022-11-03 02:46:07,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52085ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:46:07, skipping insertion in model container [2022-11-03 02:46:07,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:46:07" (2/3) ... [2022-11-03 02:46:07,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52085ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:46:07, skipping insertion in model container [2022-11-03 02:46:07,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:46:07" (3/3) ... [2022-11-03 02:46:07,787 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-03 02:46:07,811 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:46:07,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:46:07,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:46:07,888 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;@189c1f22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:46:07,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:46:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:46:07,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:46:07,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:46:07,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:46:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:46:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 165599205, now seen corresponding path program 1 times [2022-11-03 02:46:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:46:07,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974600932] [2022-11-03 02:46:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:46:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:08,358 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:46:08,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:46:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974600932] [2022-11-03 02:46:08,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974600932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:46:08,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:46:08,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:46:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784527527] [2022-11-03 02:46:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:46:08,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:46:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:46:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:46:08,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:46:08,403 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:46:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:46:08,467 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2022-11-03 02:46:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:46:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-03 02:46:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:46:08,477 INFO L225 Difference]: With dead ends: 37 [2022-11-03 02:46:08,478 INFO L226 Difference]: Without dead ends: 19 [2022-11-03 02:46:08,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:46:08,484 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:46:08,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:46:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-03 02:46:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-03 02:46:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-03 02:46:08,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-11-03 02:46:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:46:08,525 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-03 02:46:08,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:46:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-03 02:46:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:46:08,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:46:08,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:46:08,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:46:08,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:46:08,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:46:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 523554530, now seen corresponding path program 1 times [2022-11-03 02:46:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:46:08,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527901320] [2022-11-03 02:46:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:46:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:46:08,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:46:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527901320] [2022-11-03 02:46:08,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527901320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:46:08,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:46:08,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:46:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497636498] [2022-11-03 02:46:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:46:08,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:46:08,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:46:08,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:46:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:46:08,722 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:46:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:46:08,778 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-03 02:46:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:46:08,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-11-03 02:46:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:46:08,782 INFO L225 Difference]: With dead ends: 29 [2022-11-03 02:46:08,783 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:46:08,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:46:08,787 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:46:08,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:46:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:46:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2022-11-03 02:46:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-11-03 02:46:08,796 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2022-11-03 02:46:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:46:08,797 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-11-03 02:46:08,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:46:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-11-03 02:46:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:46:08,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:46:08,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:46:08,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:46:08,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:46:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:46:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 517856597, now seen corresponding path program 1 times [2022-11-03 02:46:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:46:08,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044260021] [2022-11-03 02:46:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:46:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:46:09,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:46:09,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044260021] [2022-11-03 02:46:09,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044260021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:46:09,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:46:09,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:46:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870281338] [2022-11-03 02:46:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:46:09,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:46:09,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:46:09,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:46:09,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:46:09,082 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:46:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:46:09,190 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-03 02:46:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:46:09,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-03 02:46:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:46:09,193 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:46:09,193 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:46:09,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:46:09,202 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:46:09,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 34 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:46:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:46:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-11-03 02:46:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-03 02:46:09,215 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20 [2022-11-03 02:46:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:46:09,217 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-03 02:46:09,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:46:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-03 02:46:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:46:09,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:46:09,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:46:09,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:46:09,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:46:09,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:46:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 250342324, now seen corresponding path program 1 times [2022-11-03 02:46:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:46:09,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081562959] [2022-11-03 02:46:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:46:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:46:09,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:46:09,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081562959] [2022-11-03 02:46:09,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081562959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:46:09,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883179042] [2022-11-03 02:46:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:46:09,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:46:09,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:46:09,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:46:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:09,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:46:09,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:46:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:46:09,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:46:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:46:09,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883179042] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:46:09,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1517670423] [2022-11-03 02:46:09,844 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:46:09,844 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:46:09,848 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:46:09,854 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:46:09,854 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:46:09,969 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:46:09,981 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:46:10,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,011 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 27 treesize of output 17 [2022-11-03 02:46:10,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-03 02:46:10,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,061 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 21 treesize of output 26 [2022-11-03 02:46:10,734 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 9 treesize of output 3 [2022-11-03 02:46:10,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:10,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:10,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:10,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:10,803 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:10,806 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:10,809 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:11,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:11,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:11,079 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 7 treesize of output 3 [2022-11-03 02:46:11,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:11,102 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,105 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,107 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:11,178 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:46:11,179 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 02:46:11,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:11,211 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:46:11,212 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-03 02:46:11,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-03 02:46:11,424 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 9 treesize of output 3 [2022-11-03 02:46:11,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:11,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:11,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:11,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:11,481 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,484 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,486 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,731 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 7 treesize of output 3 [2022-11-03 02:46:11,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:11,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:11,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:11,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:11,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,786 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,789 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:11,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,856 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:46:11,856 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-03 02:46:11,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-03 02:46:11,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,908 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:46:11,909 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-03 02:46:11,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,981 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 35 treesize of output 7 [2022-11-03 02:46:11,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-03 02:46:12,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:12,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:12,011 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 29 treesize of output 17 [2022-11-03 02:46:12,233 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 13 treesize of output 9 [2022-11-03 02:46:12,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:12,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:12,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:12,347 INFO L356 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-03 02:46:12,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 234 [2022-11-03 02:46:12,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:12,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:12,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:12,468 INFO L356 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-03 02:46:12,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 218 [2022-11-03 02:46:16,631 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 13 treesize of output 9 [2022-11-03 02:46:16,669 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:46:16,669 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-11-03 02:46:16,708 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:46:16,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-11-03 02:46:17,040 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:46:17,208 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:46:26,278 WARN L234 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:46:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1517670423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:46:28,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:46:28,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 19 [2022-11-03 02:46:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014964525] [2022-11-03 02:46:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:46:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:46:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:46:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:46:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:46:28,021 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:46:28,648 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-11-03 02:46:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:46:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-03 02:46:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:46:28,650 INFO L225 Difference]: With dead ends: 31 [2022-11-03 02:46:28,651 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:46:28,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:46:28,652 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:46:28,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2022-11-03 02:46:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:46:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-11-03 02:46:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-11-03 02:46:28,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 21 [2022-11-03 02:46:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:46:28,662 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-03 02:46:28,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-11-03 02:46:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:46:28,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:46:28,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:46:28,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:46:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:46:28,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:46:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:46:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -831696074, now seen corresponding path program 1 times [2022-11-03 02:46:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:46:28,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073262393] [2022-11-03 02:46:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:46:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:29,014 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:46:29,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:46:29,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073262393] [2022-11-03 02:46:29,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073262393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:46:29,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91809891] [2022-11-03 02:46:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:29,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:46:29,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:46:29,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:46:29,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:46:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:29,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:46:29,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:46:29,212 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:46:29,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:46:29,252 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:46:29,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91809891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:46:29,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1485524174] [2022-11-03 02:46:29,255 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:46:29,255 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:46:29,255 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:46:29,255 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:46:29,256 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:46:29,282 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:46:29,286 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:46:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-03 02:46:29,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,313 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 21 treesize of output 26 [2022-11-03 02:46:29,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-03 02:46:29,569 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 7 treesize of output 3 [2022-11-03 02:46:29,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:29,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:29,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:29,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:29,619 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:29,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:29,624 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:29,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:29,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:29,810 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 9 treesize of output 3 [2022-11-03 02:46:29,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:29,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:29,841 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:29,844 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:29,851 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:29,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:29,906 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:46:29,906 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 02:46:29,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:29,933 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:46:29,934 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-03 02:46:29,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:29,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-03 02:46:30,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:30,169 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 7 treesize of output 3 [2022-11-03 02:46:30,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:30,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:30,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:30,217 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,218 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,220 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,222 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:30,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:30,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:30,454 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 7 treesize of output 3 [2022-11-03 02:46:30,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:30,473 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,475 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,477 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,478 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:30,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-11-03 02:46:30,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,623 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:46:30,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 338 [2022-11-03 02:46:30,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,676 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:46:30,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 248 [2022-11-03 02:46:30,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,710 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 37 treesize of output 13 [2022-11-03 02:46:30,730 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 02:46:30,730 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 106 [2022-11-03 02:46:30,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 62 [2022-11-03 02:46:30,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:30,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,807 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 29 treesize of output 17 [2022-11-03 02:46:30,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,817 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 29 treesize of output 17 [2022-11-03 02:46:30,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:30,834 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 35 treesize of output 7 [2022-11-03 02:46:31,003 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 13 treesize of output 9 [2022-11-03 02:46:31,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:31,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:31,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:31,125 INFO L356 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-03 02:46:31,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 237 [2022-11-03 02:46:31,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:31,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:31,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:31,224 INFO L356 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-03 02:46:31,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 205 [2022-11-03 02:46:33,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 13 treesize of output 9 [2022-11-03 02:46:33,598 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:46:33,599 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2022-11-03 02:46:33,636 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:46:33,636 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 124 [2022-11-03 02:46:34,060 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:46:34,195 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:46:43,320 WARN L234 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:46:45,744 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '648#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-03 02:46:45,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:46:45,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:46:45,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-03 02:46:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183272697] [2022-11-03 02:46:45,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:46:45,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:46:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:46:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:46:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:46:45,746 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:46:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:46:45,849 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-11-03 02:46:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:46:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-11-03 02:46:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:46:45,850 INFO L225 Difference]: With dead ends: 35 [2022-11-03 02:46:45,850 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 02:46:45,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:46:45,851 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:46:45,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:46:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 02:46:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-11-03 02:46:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:46:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-03 02:46:45,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 22 [2022-11-03 02:46:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:46:45,863 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-03 02:46:45,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:46:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-03 02:46:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:46:45,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:46:45,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:46:45,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 02:46:46,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:46:46,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:46:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:46:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1430491229, now seen corresponding path program 2 times [2022-11-03 02:46:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:46:46,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775135941] [2022-11-03 02:46:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:46:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:46:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:46:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:46:48,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:46:48,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775135941] [2022-11-03 02:46:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775135941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:46:48,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916205122] [2022-11-03 02:46:48,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:46:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:46:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:46:48,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:46:48,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:46:49,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:46:49,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:46:49,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-03 02:46:49,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:46:49,073 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:46:49,225 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:46:49,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:46:49,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 02:46:49,272 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:46:49,280 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 9 treesize of output 11 [2022-11-03 02:46:49,347 INFO L356 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-03 02:46:49,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_97| input size 49 context size 49 output size 49 [2022-11-03 02:46:49,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026112878] [2022-11-03 02:46:49,350 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:46:49,350 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:46:49,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:46:49,350 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:46:49,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:46:49,367 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:46:49,371 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:46:49,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:49,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:49,381 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 27 treesize of output 17 [2022-11-03 02:46:49,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:49,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:49,396 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 21 treesize of output 26 [2022-11-03 02:46:49,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:49,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:49,405 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 27 treesize of output 17 [2022-11-03 02:46:49,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:49,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:49,702 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 7 treesize of output 3 [2022-11-03 02:46:49,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:49,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:49,732 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:49,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:49,738 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:49,740 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:49,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:49,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:49,932 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 7 treesize of output 3 [2022-11-03 02:46:49,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:49,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:49,961 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:49,963 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:49,965 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,056 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-11-03 02:46:50,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,118 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:46:50,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 338 [2022-11-03 02:46:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,164 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 02:46:50,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 243 [2022-11-03 02:46:50,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,210 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 49 treesize of output 13 [2022-11-03 02:46:50,232 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-03 02:46:50,233 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 2 case distinctions, treesize of input 65 treesize of output 38 [2022-11-03 02:46:50,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-11-03 02:46:50,264 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-03 02:46:50,264 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 2 case distinctions, treesize of input 48 treesize of output 23 [2022-11-03 02:46:50,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-11-03 02:46:50,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:50,467 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 7 treesize of output 3 [2022-11-03 02:46:50,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:50,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:50,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:46:50,505 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,507 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,509 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,511 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:50,703 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 9 treesize of output 3 [2022-11-03 02:46:50,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:50,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:46:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:46:50,744 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,747 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,749 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:46:50,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-03 02:46:50,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,819 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:46:50,820 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-03 02:46:50,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,843 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:46:50,844 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-03 02:46:50,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,884 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 35 treesize of output 7 [2022-11-03 02:46:50,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:50,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-03 02:46:50,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:50,915 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 29 treesize of output 17 [2022-11-03 02:46:51,078 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 13 treesize of output 9 [2022-11-03 02:46:51,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:51,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:51,191 INFO L356 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-03 02:46:51,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 234 [2022-11-03 02:46:51,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:51,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:46:51,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:46:51,294 INFO L356 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-03 02:46:51,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 218 [2022-11-03 02:46:52,127 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:46:52,127 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-11-03 02:46:52,170 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:46:52,171 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-11-03 02:46:52,229 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 13 treesize of output 9 [2022-11-03 02:46:52,511 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:46:52,680 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:02,237 WARN L234 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 120 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:47:05,102 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '830#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-03 02:47:05,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:47:05,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:47:05,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-11-03 02:47:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359614509] [2022-11-03 02:47:05,103 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 02:47:05,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 02:47:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 02:47:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 02:47:05,104 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 22 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:47:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:06,565 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-11-03 02:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:47:06,566 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-03 02:47:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:06,570 INFO L225 Difference]: With dead ends: 51 [2022-11-03 02:47:06,570 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 02:47:06,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=262, Invalid=2600, Unknown=0, NotChecked=0, Total=2862 [2022-11-03 02:47:06,575 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:06,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 110 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:47:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 02:47:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-11-03 02:47:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:47:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-11-03 02:47:06,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2022-11-03 02:47:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:06,599 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-11-03 02:47:06,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:47:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-11-03 02:47:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:47:06,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:06,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:06,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:47:06,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 02:47:06,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:47:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:06,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1397928665, now seen corresponding path program 3 times [2022-11-03 02:47:06,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:06,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37967623] [2022-11-03 02:47:06,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:06,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:06,965 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:47:06,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:06,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37967623] [2022-11-03 02:47:06,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37967623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:06,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:47:06,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:47:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639142124] [2022-11-03 02:47:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:47:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:47:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:47:06,968 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:47:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:07,060 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-11-03 02:47:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:47:07,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-03 02:47:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:07,062 INFO L225 Difference]: With dead ends: 42 [2022-11-03 02:47:07,062 INFO L226 Difference]: Without dead ends: 37 [2022-11-03 02:47:07,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:47:07,063 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:07,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-03 02:47:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-03 02:47:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:47:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-11-03 02:47:07,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-11-03 02:47:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:07,084 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-11-03 02:47:07,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:47:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-11-03 02:47:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:47:07,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:07,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:07,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:47:07,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:47:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1597655288, now seen corresponding path program 4 times [2022-11-03 02:47:07,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:07,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559401689] [2022-11-03 02:47:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:07,212 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:47:07,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559401689] [2022-11-03 02:47:07,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559401689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278347393] [2022-11-03 02:47:07,213 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:47:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:07,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:07,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:47:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:07,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:47:07,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:47:07,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:47:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:47:07,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278347393] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:47:07,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1753297685] [2022-11-03 02:47:07,503 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:47:07,503 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:47:07,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:47:07,504 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:47:07,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:47:07,523 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:47:07,527 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:47:07,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-03 02:47:07,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,545 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 27 treesize of output 17 [2022-11-03 02:47:07,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-03 02:47:07,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:47:07,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:07,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:07,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:07,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:47:07,834 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 9 treesize of output 3 [2022-11-03 02:47:07,842 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:07,844 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:07,846 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:07,848 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:07,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:07,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:07,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:07,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:07,991 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 7 treesize of output 3 [2022-11-03 02:47:08,005 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,006 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,009 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:08,059 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:47:08,059 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-03 02:47:08,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-03 02:47:08,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:08,101 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:47:08,101 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 02:47:08,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:08,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:08,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:08,274 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 7 treesize of output 3 [2022-11-03 02:47:08,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:08,293 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,296 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,297 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,299 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,428 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 7 treesize of output 3 [2022-11-03 02:47:08,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:08,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:08,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:08,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:08,472 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,476 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,477 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:08,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-03 02:47:08,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,554 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:47:08,554 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-03 02:47:08,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,577 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:47:08,577 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-03 02:47:08,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,624 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 35 treesize of output 7 [2022-11-03 02:47:08,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:08,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,634 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 29 treesize of output 17 [2022-11-03 02:47:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-03 02:47:08,812 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 13 treesize of output 9 [2022-11-03 02:47:08,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:08,928 INFO L356 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-03 02:47:08,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 242 [2022-11-03 02:47:08,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:08,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:09,025 INFO L356 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-03 02:47:09,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 210 [2022-11-03 02:47:10,511 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:47:10,512 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2022-11-03 02:47:10,546 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:47:10,546 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 124 [2022-11-03 02:47:10,609 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 13 treesize of output 9 [2022-11-03 02:47:10,895 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:47:11,027 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:22,028 WARN L234 SmtUtils]: Spent 10.01s on a formula simplification. DAG size of input: 120 DAG size of output: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:47:24,298 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1320#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= |#NULL.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-03 02:47:24,298 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:47:24,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:47:24,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-11-03 02:47:24,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139302554] [2022-11-03 02:47:24,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:47:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:47:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:47:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:47:24,300 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:47:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:24,453 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-11-03 02:47:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:47:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-03 02:47:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:24,454 INFO L225 Difference]: With dead ends: 51 [2022-11-03 02:47:24,454 INFO L226 Difference]: Without dead ends: 41 [2022-11-03 02:47:24,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:47:24,455 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:24,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-03 02:47:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-11-03 02:47:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:47:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-11-03 02:47:24,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 25 [2022-11-03 02:47:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:24,473 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-11-03 02:47:24,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:47:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-11-03 02:47:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:47:24,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:24,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:24,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:47:24,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:24,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:47:24,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1370605950, now seen corresponding path program 5 times [2022-11-03 02:47:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:24,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325616527] [2022-11-03 02:47:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:24,812 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:47:24,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:24,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325616527] [2022-11-03 02:47:24,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325616527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:24,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907042279] [2022-11-03 02:47:24,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:47:24,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:24,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:24,814 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:24,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:47:25,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:47:25,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:47:25,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:47:25,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:25,631 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:47:25,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:47:25,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907042279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:25,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:47:25,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-11-03 02:47:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242576331] [2022-11-03 02:47:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:25,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:47:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:25,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:47:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:47:25,633 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:47:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:25,736 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-11-03 02:47:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:47:25,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-03 02:47:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:25,738 INFO L225 Difference]: With dead ends: 49 [2022-11-03 02:47:25,738 INFO L226 Difference]: Without dead ends: 37 [2022-11-03 02:47:25,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:47:25,741 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:25,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:47:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-03 02:47:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-03 02:47:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:47:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-03 02:47:25,772 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2022-11-03 02:47:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:25,772 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-03 02:47:25,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:47:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-03 02:47:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:47:25,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:25,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:25,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:47:25,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:25,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:47:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1052870022, now seen corresponding path program 1 times [2022-11-03 02:47:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:25,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138987156] [2022-11-03 02:47:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:47:26,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:26,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138987156] [2022-11-03 02:47:26,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138987156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907915599] [2022-11-03 02:47:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:26,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:26,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:26,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:26,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:47:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:27,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-03 02:47:27,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-03 02:47:27,441 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 19 treesize of output 7 [2022-11-03 02:47:27,459 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:47:27,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:47:27,619 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 38 treesize of output 32 [2022-11-03 02:47:27,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,729 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:47:27,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907915599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:47:27,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1115768632] [2022-11-03 02:47:27,731 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:47:27,732 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:47:27,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:47:27,732 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:47:27,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:47:27,750 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:47:27,762 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:47:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,778 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 21 treesize of output 26 [2022-11-03 02:47:27,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,788 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 27 treesize of output 17 [2022-11-03 02:47:27,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:27,795 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 27 treesize of output 17 [2022-11-03 02:47:28,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:28,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:28,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,046 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 7 treesize of output 3 [2022-11-03 02:47:28,056 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,058 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,059 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:47:28,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:47:28,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,278 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 9 treesize of output 3 [2022-11-03 02:47:28,288 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,290 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,294 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-03 02:47:28,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:28,375 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:47:28,376 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-03 02:47:28,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:28,400 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:47:28,401 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 02:47:28,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:28,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,599 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 7 treesize of output 3 [2022-11-03 02:47:28,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:28,618 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,620 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,622 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:28,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:28,834 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 7 treesize of output 3 [2022-11-03 02:47:28,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:28,855 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,856 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,858 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,861 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:47:28,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:28,916 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:47:28,917 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-03 02:47:28,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:28,941 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:47:28,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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 02:47:28,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:28,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-03 02:47:29,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,003 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 35 treesize of output 7 [2022-11-03 02:47:29,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:29,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,013 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 29 treesize of output 17 [2022-11-03 02:47:29,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,022 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 29 treesize of output 17 [2022-11-03 02:47:29,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:29,255 INFO L356 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-03 02:47:29,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 242 [2022-11-03 02:47:29,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:29,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:29,343 INFO L356 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-03 02:47:29,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 210 [2022-11-03 02:47:31,879 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 13 treesize of output 9 [2022-11-03 02:47:32,244 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:47:32,244 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-11-03 02:47:32,275 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:47:32,276 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-11-03 02:47:32,338 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 13 treesize of output 9 [2022-11-03 02:47:32,922 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:47:33,061 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:42,169 WARN L234 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 120 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:47:44,675 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1922#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-03 02:47:44,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:47:44,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:47:44,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 30 [2022-11-03 02:47:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461439123] [2022-11-03 02:47:44,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:47:44,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:47:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:47:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 02:47:44,679 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:47:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:45,654 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-03 02:47:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:47:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2022-11-03 02:47:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:45,655 INFO L225 Difference]: With dead ends: 48 [2022-11-03 02:47:45,655 INFO L226 Difference]: Without dead ends: 46 [2022-11-03 02:47:45,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 02:47:45,657 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 120 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:45,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 184 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:47:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-03 02:47:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-11-03 02:47:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:47:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-03 02:47:45,699 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2022-11-03 02:47:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:45,699 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-03 02:47:45,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:47:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-03 02:47:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:47:45,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:45,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:45,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:47:45,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:47:45,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:47:45,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1718394160, now seen corresponding path program 2 times [2022-11-03 02:47:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:45,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998291344] [2022-11-03 02:47:45,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:46,046 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:47:46,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:46,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998291344] [2022-11-03 02:47:46,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998291344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458486171] [2022-11-03 02:47:46,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:47:46,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:46,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:46,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:47:46,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:47:46,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:47:46,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:47:46,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:46,374 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:47:46,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:47:46,428 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:47:46,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458486171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:47:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1527967701] [2022-11-03 02:47:46,434 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:47:46,434 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:47:46,434 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:47:46,434 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:47:46,435 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:47:46,455 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:47:46,459 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:47:46,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,475 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 21 treesize of output 26 [2022-11-03 02:47:46,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,482 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 27 treesize of output 17 [2022-11-03 02:47:46,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,489 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 27 treesize of output 17 [2022-11-03 02:47:46,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,610 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 7 treesize of output 3 [2022-11-03 02:47:46,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,699 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 7 treesize of output 3 [2022-11-03 02:47:46,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:46,752 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:47:46,753 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-11-03 02:47:46,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-11-03 02:47:46,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:46,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:46,799 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:47:46,800 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-11-03 02:47:46,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,883 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 7 treesize of output 3 [2022-11-03 02:47:46,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,928 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 7 treesize of output 3 [2022-11-03 02:47:46,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:47:46,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:47:46,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,006 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:47:47,006 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-03 02:47:47,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,030 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:47:47,031 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-03 02:47:47,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-03 02:47:47,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-03 02:47:47,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:47:47,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,109 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 29 treesize of output 17 [2022-11-03 02:47:47,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:47,126 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 35 treesize of output 7 [2022-11-03 02:47:47,202 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 13 treesize of output 9 [2022-11-03 02:47:47,211 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 19 treesize of output 1 [2022-11-03 02:47:47,220 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 19 treesize of output 1 [2022-11-03 02:47:47,359 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 13 treesize of output 9 [2022-11-03 02:47:47,398 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:47:47,398 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-11-03 02:47:47,439 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:47:47,439 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-11-03 02:47:47,900 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:47:48,030 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:57,772 WARN L234 SmtUtils]: Spent 8.94s on a formula simplification. DAG size of input: 120 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:47:59,740 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2277#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-03 02:47:59,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:47:59,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:47:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-11-03 02:47:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144598868] [2022-11-03 02:47:59,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:47:59,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:47:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:47:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:47:59,742 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:47:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:59,897 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-11-03 02:47:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:47:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-11-03 02:47:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:59,898 INFO L225 Difference]: With dead ends: 45 [2022-11-03 02:47:59,899 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 02:47:59,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:47:59,900 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:59,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 02:47:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-03 02:47:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:47:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-03 02:47:59,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2022-11-03 02:47:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:59,915 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-03 02:47:59,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 02:47:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-03 02:47:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:47:59,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:59,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:59,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:48:00,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:00,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:48:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash 139383584, now seen corresponding path program 6 times [2022-11-03 02:48:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:00,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968722429] [2022-11-03 02:48:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:48:00,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:00,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968722429] [2022-11-03 02:48:00,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968722429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:48:00,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443512844] [2022-11-03 02:48:00,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:48:00,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:48:00,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:48:00,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:48:01,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:48:01,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:48:01,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:48:01,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:48:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:48:01,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:48:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:48:01,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443512844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:48:01,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [720470466] [2022-11-03 02:48:01,791 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:48:01,791 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:48:01,792 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:48:01,792 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:48:01,792 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:48:01,815 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:48:01,819 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:48:01,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:01,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:01,836 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 21 treesize of output 26 [2022-11-03 02:48:01,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:01,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:01,844 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 27 treesize of output 17 [2022-11-03 02:48:01,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:01,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:01,852 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 27 treesize of output 17 [2022-11-03 02:48:02,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:48:02,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:48:02,065 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 7 treesize of output 3 [2022-11-03 02:48:02,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:02,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:02,099 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,101 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,106 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,108 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:48:02,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:02,308 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 7 treesize of output 3 [2022-11-03 02:48:02,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:02,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:48:02,339 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,340 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,342 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,344 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,436 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-11-03 02:48:02,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,483 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:48:02,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 339 [2022-11-03 02:48:02,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:02,535 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:48:02,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 231 [2022-11-03 02:48:02,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,565 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 49 treesize of output 13 [2022-11-03 02:48:02,591 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-03 02:48:02,591 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 114 [2022-11-03 02:48:02,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 78 [2022-11-03 02:48:02,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:02,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:48:02,824 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 9 treesize of output 3 [2022-11-03 02:48:02,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:02,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:48:02,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:02,865 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,867 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:02,869 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:03,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:03,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:48:03,074 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 7 treesize of output 3 [2022-11-03 02:48:03,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:48:03,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-03 02:48:03,102 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:03,103 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:03,106 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:03,107 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:48:03,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-11-03 02:48:03,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,176 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:48:03,177 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-11-03 02:48:03,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,200 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:48:03,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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-11-03 02:48:03,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,234 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 29 treesize of output 17 [2022-11-03 02:48:03,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,248 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 35 treesize of output 7 [2022-11-03 02:48:03,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:03,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,258 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 29 treesize of output 17 [2022-11-03 02:48:03,384 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 13 treesize of output 9 [2022-11-03 02:48:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:03,491 INFO L356 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-11-03 02:48:03,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 242 [2022-11-03 02:48:03,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:48:03,593 INFO L356 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-03 02:48:03,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 210 [2022-11-03 02:48:05,223 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:48:05,224 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-11-03 02:48:05,266 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-03 02:48:05,266 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-11-03 02:48:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:48:05,710 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-11-03 02:48:05,875 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:48:17,740 WARN L234 SmtUtils]: Spent 10.75s on a formula simplification. DAG size of input: 120 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:48:20,276 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2600#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= |#NULL.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-11-03 02:48:20,276 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:48:20,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:48:20,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 12 [2022-11-03 02:48:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982266028] [2022-11-03 02:48:20,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:48:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:48:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:48:20,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:48:20,278 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:48:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:20,383 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-03 02:48:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:48:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 30 [2022-11-03 02:48:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:20,384 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:48:20,384 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:48:20,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:48:20,385 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:48:20,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:48:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:48:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:48:20,387 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:48:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:48:20,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-11-03 02:48:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:20,387 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:48:20,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:48:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:48:20,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:48:20,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:48:20,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-03 02:48:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:48:20,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:48:24,630 INFO L895 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-11-03 02:48:24,630 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 4) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |#NULL.offset|) (= (select .cse1 0) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 02:48:24,630 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-03 02:48:24,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:48:24,631 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse30 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse9 (select (select |#memory_int| .cse30) 8))) (let ((.cse8 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse12 (<= .cse10 .cse9)) (.cse13 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse3 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (not (= .cse30 |ULTIMATE.start_main_~s~0#1.base|))) (.cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse14 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse16 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (.cse17 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse18 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse21 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse23 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse24 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse27 (= |#NULL.base| 0)) (.cse28 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~len~0#1| .cse8) (<= .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (let ((.cse29 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse29 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~len~0#1| .cse29) (<= .cse8 |ULTIMATE.start_main_~len~0#1|) .cse12 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse10) .cse13 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (* |ULTIMATE.start_main_~len~0#1| 2)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse27 .cse28)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse26 .cse27 .cse28))))) [2022-11-03 02:48:24,631 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-11-03 02:48:24,631 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-11-03 02:48:24,631 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse26 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse1 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse2 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse7 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse8 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse26)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse15 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse16 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse17 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse18 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse19 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse20 (<= 0 |#StackHeapBarrier|)) (.cse23 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse21 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse22 (= |#NULL.base| 0))) (or (let ((.cse5 (select .cse23 8))) (and .cse0 .cse1 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= .cse5 |ULTIMATE.start_main_~len~0#1|) .cse6 (<= |ULTIMATE.start_main_~len~0#1| .cse5) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse21 .cse22)) (let ((.cse25 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (.cse24 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (<= .cse24 .cse25) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= .cse25 .cse24) (= .cse26 (+ 2 (select .cse23 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse21 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse22 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))))) [2022-11-03 02:48:24,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-11-03 02:48:24,632 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 02:48:24,632 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-11-03 02:48:24,632 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-11-03 02:48:24,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:48:24,633 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse30 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse32 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse33 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|)) (.cse35 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse28 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse31 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse34 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse36 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse37 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse39 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))) (let ((.cse10 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse11 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse12 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse13 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse14 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse16 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse17 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse20 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse21 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse22 (or (and .cse28 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39) (and .cse28 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) .cse31 .cse34 .cse36 .cse37 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse39))) (.cse23 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse24 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse25 (<= 0 |#StackHeapBarrier|)) (.cse26 (= |ULTIMATE.start_main_~len~0#1| .cse30)) (.cse27 (= |#NULL.base| 0))) (let ((.cse0 (let ((.cse29 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse38 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (and .cse28 .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 (< 0 .cse30) .cse15 .cse16 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse17 .cse18 .cse19 .cse37 .cse20 .cse21 (<= |ULTIMATE.start_main_~i~0#1| 1) .cse23 .cse24 .cse25 .cse38 .cse39 .cse27) (and .cse10 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38 .cse27)))) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse9 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (select .cse9 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and .cse0 .cse1 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= .cse6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (not (= .cse7 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (<= (select (select |#memory_int| .cse7) 8) .cse6) .cse2 .cse3 .cse4 (= (select .cse8 |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse5)) (and (= (select .cse8 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (not (= (select .cse9 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) .cse15 .cse16 .cse2 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse4 .cse27 .cse5))))) [2022-11-03 02:48:24,633 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-11-03 02:48:24,633 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-11-03 02:48:24,634 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse1 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse1 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) .cse2 (= (select .cse3 4) 0) .cse4 .cse5 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) .cse6 (<= 0 |#NULL.offset|) (= (select .cse3 0) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8) (and .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= (select .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse2 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse3 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) .cse4 (= |#NULL.offset| 0) .cse5 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) .cse8 (not .cse6)))) [2022-11-03 02:48:24,634 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse39 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse41 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (.cse40 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse9 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse40)) (.cse12 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (.cse13 (<= .cse39 .cse41)) (.cse24 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse25 (<= .cse41 .cse39)) (.cse27 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse29 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse30 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse1 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse32 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse2 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse33 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse34 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse8 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse6 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse14 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse35 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse15 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse18 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse19 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse20 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse31 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (.cse36 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse21 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse23 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse38 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse26 (= .cse40 (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8))))) (.cse28 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 |ULTIMATE.start_main_~expected~0#1|) .cse7 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse20 .cse21 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse22 .cse23 .cse24 .cse25 .cse26 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse27 .cse28 .cse29) (and .cse30 .cse0 (<= |ULTIMATE.start_main_~expected~0#1| .cse31) .cse1 .cse32 .cse2 .cse3 .cse4 .cse5 .cse33 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse35 .cse15 .cse16 .cse17 .cse18 .cse19 (<= .cse31 |ULTIMATE.start_main_~expected~0#1|) .cse20 .cse36 .cse21 .cse22 .cse23 .cse37 .cse24 .cse25 .cse38 .cse26 .cse27 .cse28 .cse29) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse30 .cse0 .cse1 .cse32 .cse2 .cse3 .cse5 .cse33 (= |ULTIMATE.start_main_~len~0#1| .cse39) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse34 .cse8 .cse10 .cse11 (= .cse6 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse14 .cse35 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= .cse31 2) .cse36 .cse21 .cse22 .cse23 .cse37 .cse38 .cse26 .cse28)))) [2022-11-03 02:48:24,634 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-11-03 02:48:24,634 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-11-03 02:48:24,635 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse2 (not (= |#NULL.base| 0))) (.cse3 (not (= |node_create_#in~data#1| 1)))) (and (let ((.cse4 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse2 .cse3 (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse4 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse4 1) 0)))) (or .cse0 .cse1 .cse2 .cse3 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|)) (.cse6 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|))) (or (not (= (select .cse5 0) 0)) (not (= (select .cse5 4) 0)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 12)) (not (= (select .cse6 4) 0)) (not (= (select .cse6 0) 0)) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|)) (not (= (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 8) |node_create_#in~data#1|)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| 0) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 1)))))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-03 02:48:24,635 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-11-03 02:48:24,639 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2022-11-03 02:48:24,641 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,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:48:24,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:48:24,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:48:24,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:48:24,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:48:24,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,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:48:24,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:48:24,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,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:48:24,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,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:48:24,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:48:24,690 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,691 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,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:48:24,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,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:48:24,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:48:24,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:48:24,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,714 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,718 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,719 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,722 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,724 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,727 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,728 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,729 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:48:24 BoogieIcfgContainer [2022-11-03 02:48:24,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:48:24,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:48:24,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:48:24,735 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:48:24,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:46:07" (3/4) ... [2022-11-03 02:48:24,753 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:48:24,759 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-03 02:48:24,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-03 02:48:24,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-03 02:48:24,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 02:48:24,766 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:48:24,794 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && #NULL <= 0) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && data == 1) && #memory_$Pointer$[head][4] == 0) && len == 2) && 1 <= data) && !(head == 0)) && head == last) && 0 <= #NULL) && #memory_$Pointer$[head][0] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(head == last)) [2022-11-03 02:48:24,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && !(#memory_$Pointer$[s][s] == s)) && len == 2 + i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && index <= 0) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && 2 + i <= len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && !(#memory_$Pointer$[s][s] == s)) && #memory_$Pointer$[s][s] == 0) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) [2022-11-03 02:48:24,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && s == head) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) [2022-11-03 02:48:24,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0)) && #memory_$Pointer$[head][head] == 0) && #memory_$Pointer$[s][s] == 0) && !(head == s)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && s == 0) && !(head == last)) || (((((((((((((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0)) && #memory_$Pointer$[head][head] == 0) && 2 + i <= len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && !(head == #memory_$Pointer$[head][head])) && len == 2) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == last))) || ((((((((((((((((((((((((((#memory_$Pointer$[head][head] == 0 && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && s == head) && !(#memory_$Pointer$[head][head] == s)) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) [2022-11-03 02:48:24,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((head == 0 && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && len + i == expected) && s == head) && s == head) && head == s) && \old(index) == i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && head == head) && \old(len) <= 2) && len <= 1) && head == head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) || ((((((((((((((((((((((((((((((((((((((0 <= s && 2 <= \old(len)) && expected <= unknown-#memory_int-unknown[head][8 + head]) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && index <= 0) && s == head) && 0 <= i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && unknown-#memory_int-unknown[head][8 + head] <= expected) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((((((((((head == 0 && 0 <= s) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && len == 2 + i) && 2 == expected) && 0 <= i) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && unknown-#memory_int-unknown[head][8 + head] == 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && #NULL == 0) [2022-11-03 02:48:24,811 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:48:24,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:48:24,812 INFO L158 Benchmark]: Toolchain (without parser) took 138349.91ms. Allocated memory was 98.6MB in the beginning and 371.2MB in the end (delta: 272.6MB). Free memory was 58.9MB in the beginning and 275.0MB in the end (delta: -216.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2022-11-03 02:48:24,812 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 77.3MB in the end (delta: 51.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:48:24,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.93ms. Allocated memory is still 98.6MB. Free memory was 58.7MB in the beginning and 64.8MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:48:24,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.34ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:48:24,813 INFO L158 Benchmark]: Boogie Preprocessor took 38.78ms. Allocated memory is still 98.6MB. Free memory was 62.7MB in the beginning and 60.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:48:24,813 INFO L158 Benchmark]: RCFGBuilder took 614.96ms. Allocated memory is still 98.6MB. Free memory was 60.8MB in the beginning and 40.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-03 02:48:24,814 INFO L158 Benchmark]: TraceAbstraction took 136976.14ms. Allocated memory was 98.6MB in the beginning and 371.2MB in the end (delta: 272.6MB). Free memory was 39.9MB in the beginning and 278.1MB in the end (delta: -238.1MB). Peak memory consumption was 199.6MB. Max. memory is 16.1GB. [2022-11-03 02:48:24,814 INFO L158 Benchmark]: Witness Printer took 76.18ms. Allocated memory is still 371.2MB. Free memory was 278.1MB in the beginning and 275.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:48:24,815 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.24ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 77.3MB in the end (delta: 51.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.93ms. Allocated memory is still 98.6MB. Free memory was 58.7MB in the beginning and 64.8MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.34ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.78ms. Allocated memory is still 98.6MB. Free memory was 62.7MB in the beginning and 60.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 614.96ms. Allocated memory is still 98.6MB. Free memory was 60.8MB in the beginning and 40.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 136976.14ms. Allocated memory was 98.6MB in the beginning and 371.2MB in the end (delta: 272.6MB). Free memory was 39.9MB in the beginning and 278.1MB in the end (delta: -238.1MB). Peak memory consumption was 199.6MB. Max. memory is 16.1GB. * Witness Printer took 76.18ms. Allocated memory is still 371.2MB. Free memory was 278.1MB in the beginning and 275.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 416 mSDsluCounter, 644 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 59 IncrementalHoareTripleChecker+Unchecked, 596 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1116 IncrementalHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 132 mSDtfsCounter, 1116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 377 SyntacticMatches, 19 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 89.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 50 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 32 NumberOfFragments, 2297 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1673 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 4269 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 455 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 583 ConstructedInterpolants, 0 QuantifiedInterpolants, 2278 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 241/304 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.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 16, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 25, TOOLS_POST_TIME: 5.1s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 1.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 39, TOOLS_QUANTIFIERELIM_TIME: 6.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 4.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 74, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 8, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.3s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 16, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 5.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 226, DAG_COMPRESSION_RETAINED_NODES: 58, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 620]: Loop Invariant [2022-11-03 02:48:24,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:48:24,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,838 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,839 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,840 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,840 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,840 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,840 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,845 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,845 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,846 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,847 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,848 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,848 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,848 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,848 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,849 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,849 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,849 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,849 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,850 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0)) && #memory_$Pointer$[head][head] == 0) && #memory_$Pointer$[s][s] == 0) && !(head == s)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && s == 0) && !(head == last)) || (((((((((((((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0)) && #memory_$Pointer$[head][head] == 0) && 2 + i <= len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && !(head == #memory_$Pointer$[head][head])) && len == 2) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == last))) || ((((((((((((((((((((((((((#memory_$Pointer$[head][head] == 0 && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && s == head) && !(#memory_$Pointer$[head][head] == s)) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 635]: Loop Invariant [2022-11-03 02:48:24,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && s == head) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-11-03 02:48:24,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && !(#memory_$Pointer$[s][s] == s)) && len == 2 + i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && #memory_$Pointer$[s][s] == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && index <= 0) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && 2 + i <= len) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && !(#memory_$Pointer$[s][s] == s)) && #memory_$Pointer$[s][s] == 0) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2022-11-03 02:48:24,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && #NULL <= 0) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && data == 1) && #memory_$Pointer$[head][4] == 0) && len == 2) && 1 <= data) && !(head == 0)) && head == last) && 0 <= #NULL) && #memory_$Pointer$[head][0] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 613]: Loop Invariant [2022-11-03 02:48:24,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 02:48:24,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 02:48:24,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((head == 0 && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && len + i == expected) && s == head) && s == head) && head == s) && \old(index) == i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && head == head) && \old(len) <= 2) && len <= 1) && head == head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) || ((((((((((((((((((((((((((((((((((((((0 <= s && 2 <= \old(len)) && expected <= unknown-#memory_int-unknown[head][8 + head]) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && index <= 0) && s == head) && 0 <= i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && !(head == #memory_$Pointer$[head][head])) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && unknown-#memory_int-unknown[head][8 + head] <= expected) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last))) || ((((((((((((((((((((((((((((((((head == 0 && 0 <= s) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && len == 2 + i) && 2 == expected) && 0 <= i) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && unknown-#memory_int-unknown[head][8 + head] == 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && #NULL == 0) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-03 02:48:24,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f2b07d9-7bc8-4fdb-b5f6-bb8084604fc3/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