./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:56:42,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:56:42,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:56:42,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:56:42,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:56:42,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:56:42,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:56:42,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:56:42,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:56:42,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:56:42,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:56:42,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:56:42,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:56:42,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:56:42,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:56:42,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:56:42,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:56:42,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:56:42,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:56:42,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:56:42,932 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:56:42,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:56:42,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:56:42,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:56:42,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:56:42,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:56:42,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:56:42,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:56:42,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:56:42,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:56:42,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:56:42,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:56:42,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:56:42,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:56:42,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:56:42,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:56:42,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:56:42,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:56:42,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:56:42,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:56:42,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:56:42,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:56:42,943 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:56:42,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:56:42,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:56:42,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:56:42,961 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:56:42,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:56:42,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:56:42,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:56:42,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:56:42,962 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:56:42,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:56:42,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:56:42,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:56:42,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:56:42,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:56:42,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:56:42,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:56:42,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:56:42,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:56:42,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:56:42,964 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:56:42,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:56:42,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:56:42,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:56:42,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:56:42,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:42,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:56:42,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:56:42,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:56:42,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:56:42,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:56:42,966 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:56:42,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:56:42,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:56:42,966 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-13 14:56:43,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:56:43,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:56:43,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:56:43,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:56:43,152 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:56:43,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-13 14:56:43,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd47905/489d4d9900194a378d6e23f0a7ba5fd1/FLAG13aa46dc7 [2022-07-13 14:56:43,572 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:56:43,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-13 14:56:43,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd47905/489d4d9900194a378d6e23f0a7ba5fd1/FLAG13aa46dc7 [2022-07-13 14:56:43,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd47905/489d4d9900194a378d6e23f0a7ba5fd1 [2022-07-13 14:56:43,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:56:43,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:56:43,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:43,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:56:43,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:56:43,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:43" (1/1) ... [2022-07-13 14:56:43,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce86a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:43, skipping insertion in model container [2022-07-13 14:56:43,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:56:43" (1/1) ... [2022-07-13 14:56:43,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:56:44,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:56:44,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-13 14:56:44,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:44,192 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:56:44,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-13 14:56:44,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:56:44,237 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:56:44,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44 WrapperNode [2022-07-13 14:56:44,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:56:44,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:44,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:56:44,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:56:44,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,265 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-13 14:56:44,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:56:44,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:56:44,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:56:44,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:56:44,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:56:44,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:56:44,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:56:44,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:56:44,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (1/1) ... [2022-07-13 14:56:44,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:56:44,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:44,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:56:44,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:56:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-13 14:56:44,394 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-13 14:56:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 14:56:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:56:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:56:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:56:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:56:44,471 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:56:44,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:56:44,607 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:56:44,610 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:56:44,611 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 14:56:44,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:44 BoogieIcfgContainer [2022-07-13 14:56:44,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:56:44,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:56:44,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:56:44,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:56:44,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:56:43" (1/3) ... [2022-07-13 14:56:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b1210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:44, skipping insertion in model container [2022-07-13 14:56:44,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:56:44" (2/3) ... [2022-07-13 14:56:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b1210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:56:44, skipping insertion in model container [2022-07-13 14:56:44,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:44" (3/3) ... [2022-07-13 14:56:44,617 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-13 14:56:44,626 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:56:44,627 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:56:44,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:56:44,670 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70c89336, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78590559 [2022-07-13 14:56:44,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:56:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 14:56:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:56:44,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:44,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:44,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-07-13 14:56:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:44,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959431092] [2022-07-13 14:56:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:56:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:44,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959431092] [2022-07-13 14:56:44,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959431092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:44,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:44,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:56:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534599467] [2022-07-13 14:56:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:44,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:56:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:56:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:56:44,831 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:44,850 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-07-13 14:56:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:56:44,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-13 14:56:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:44,856 INFO L225 Difference]: With dead ends: 77 [2022-07-13 14:56:44,856 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 14:56:44,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:56:44,862 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:44,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 14:56:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-13 14:56:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-13 14:56:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-07-13 14:56:44,892 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-07-13 14:56:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:44,893 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-07-13 14:56:44,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-07-13 14:56:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:56:44,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:44,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:44,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:56:44,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:44,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-07-13 14:56:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:44,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353981162] [2022-07-13 14:56:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:56:45,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:45,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353981162] [2022-07-13 14:56:45,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353981162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:45,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:45,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:56:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725546341] [2022-07-13 14:56:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:56:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:45,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:56:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:56:45,053 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:45,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:45,100 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-13 14:56:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:56:45,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-13 14:56:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:45,101 INFO L225 Difference]: With dead ends: 45 [2022-07-13 14:56:45,101 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 14:56:45,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:56:45,102 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:45,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 14:56:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-13 14:56:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 14:56:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-07-13 14:56:45,108 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-07-13 14:56:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:45,109 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-07-13 14:56:45,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:56:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-07-13 14:56:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 14:56:45,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:45,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:45,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:56:45,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-07-13 14:56:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:45,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497477622] [2022-07-13 14:56:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 14:56:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:56:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:45,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497477622] [2022-07-13 14:56:45,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497477622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:45,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:45,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:56:45,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703673347] [2022-07-13 14:56:45,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:45,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:56:45,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:45,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:56:45,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:56:45,187 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:56:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:45,239 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-07-13 14:56:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:56:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-13 14:56:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:45,240 INFO L225 Difference]: With dead ends: 86 [2022-07-13 14:56:45,241 INFO L226 Difference]: Without dead ends: 63 [2022-07-13 14:56:45,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-07-13 14:56:45,242 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:45,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 134 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-13 14:56:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-07-13 14:56:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-13 14:56:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-07-13 14:56:45,249 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-07-13 14:56:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:45,249 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-07-13 14:56:45,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:56:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-07-13 14:56:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:56:45,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:45,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:45,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:56:45,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-07-13 14:56:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:45,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147902796] [2022-07-13 14:56:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:56:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 14:56:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:56:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:45,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147902796] [2022-07-13 14:56:45,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147902796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499188161] [2022-07-13 14:56:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:45,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:45,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:56:45,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 14:56:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:45,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 14:56:45,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:56:45,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:56:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:56:45,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499188161] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:56:45,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:56:45,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-13 14:56:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901129132] [2022-07-13 14:56:45,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:56:45,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 14:56:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:45,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 14:56:45,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-13 14:56:45,674 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 14:56:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:45,900 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-07-13 14:56:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:56:45,900 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-07-13 14:56:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:45,906 INFO L225 Difference]: With dead ends: 118 [2022-07-13 14:56:45,907 INFO L226 Difference]: Without dead ends: 82 [2022-07-13 14:56:45,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-13 14:56:45,913 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:45,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 14:56:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-13 14:56:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-07-13 14:56:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 14:56:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-07-13 14:56:45,933 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-07-13 14:56:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:45,933 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-07-13 14:56:45,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 14:56:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-07-13 14:56:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 14:56:45,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:45,934 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:45,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 14:56:46,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:46,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-07-13 14:56:46,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:46,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435860336] [2022-07-13 14:56:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:56:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 14:56:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:56:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:46,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435860336] [2022-07-13 14:56:46,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435860336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:46,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:46,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:56:46,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303438191] [2022-07-13 14:56:46,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:46,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:56:46,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:56:46,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:56:46,227 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:56:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:46,286 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-07-13 14:56:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:56:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-13 14:56:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:46,288 INFO L225 Difference]: With dead ends: 75 [2022-07-13 14:56:46,288 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 14:56:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:56:46,291 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 14:56:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-13 14:56:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-13 14:56:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-07-13 14:56:46,303 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-07-13 14:56:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:46,304 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-07-13 14:56:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 14:56:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-07-13 14:56:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 14:56:46,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:46,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 14:56:46,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-07-13 14:56:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:46,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428634170] [2022-07-13 14:56:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:56:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 14:56:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 14:56:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:46,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428634170] [2022-07-13 14:56:46,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428634170] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:46,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855342403] [2022-07-13 14:56:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:46,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:46,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:46,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:56:46,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 14:56:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:46,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 14:56:46,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:46,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:46,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:56:46,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:46,591 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:56:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 14:56:46,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:46,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 14:56:46,714 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-07-13 14:56:46,717 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-07-13 14:56:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:56:46,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:56:46,784 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 10 treesize of output 4 [2022-07-13 14:56:46,874 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-13 14:56:46,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-13 14:56:46,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-13 14:56:46,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 14:56:46,888 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-07-13 14:56:46,888 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-13 14:56:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 14:56:46,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855342403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:56:46,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:56:46,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-07-13 14:56:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606316312] [2022-07-13 14:56:46,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:56:46,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 14:56:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 14:56:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-13 14:56:46,910 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 14:56:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:47,385 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2022-07-13 14:56:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 14:56:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-07-13 14:56:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:47,387 INFO L225 Difference]: With dead ends: 269 [2022-07-13 14:56:47,387 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 14:56:47,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-07-13 14:56:47,389 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 193 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:47,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 881 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 381 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-07-13 14:56:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 14:56:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 90. [2022-07-13 14:56:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 74 states have internal predecessors, (92), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-13 14:56:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-07-13 14:56:47,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 37 [2022-07-13 14:56:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:47,404 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-07-13 14:56:47,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 14:56:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-07-13 14:56:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 14:56:47,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:47,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:47,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 14:56:47,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 14:56:47,629 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-07-13 14:56:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570665889] [2022-07-13 14:56:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 14:56:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:56:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:56:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:47,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570665889] [2022-07-13 14:56:47,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570665889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:47,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:47,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:56:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472619237] [2022-07-13 14:56:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:47,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:56:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:56:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:56:47,721 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 14:56:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:47,794 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-07-13 14:56:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:56:47,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-13 14:56:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:47,796 INFO L225 Difference]: With dead ends: 133 [2022-07-13 14:56:47,796 INFO L226 Difference]: Without dead ends: 102 [2022-07-13 14:56:47,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:56:47,797 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:47,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 165 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-13 14:56:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-13 14:56:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.323943661971831) internal successors, (94), 76 states have internal predecessors, (94), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-13 14:56:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2022-07-13 14:56:47,816 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 35 [2022-07-13 14:56:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:47,818 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2022-07-13 14:56:47,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 14:56:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2022-07-13 14:56:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 14:56:47,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:47,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:47,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 14:56:47,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-07-13 14:56:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:47,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454004577] [2022-07-13 14:56:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 14:56:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:56:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 14:56:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:47,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454004577] [2022-07-13 14:56:47,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454004577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:47,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:47,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:56:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754947971] [2022-07-13 14:56:47,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:47,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:56:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:56:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:56:47,896 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 14:56:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:47,926 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-07-13 14:56:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:56:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-13 14:56:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:47,928 INFO L225 Difference]: With dead ends: 99 [2022-07-13 14:56:47,928 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 14:56:47,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:56:47,929 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:47,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 14:56:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-13 14:56:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 66 states have internal predecessors, (84), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-13 14:56:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-07-13 14:56:47,942 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 35 [2022-07-13 14:56:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:47,943 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-07-13 14:56:47,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 14:56:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-07-13 14:56:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 14:56:47,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:47,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:47,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 14:56:47,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-07-13 14:56:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:47,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174909810] [2022-07-13 14:56:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 14:56:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:56:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:56:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174909810] [2022-07-13 14:56:48,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174909810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:56:48,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:56:48,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:56:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528644240] [2022-07-13 14:56:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:56:48,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:56:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:56:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:56:48,015 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 14:56:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:48,057 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-13 14:56:48,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:56:48,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-13 14:56:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:48,061 INFO L225 Difference]: With dead ends: 130 [2022-07-13 14:56:48,061 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 14:56:48,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:56:48,064 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:48,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:56:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 14:56:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-07-13 14:56:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-13 14:56:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-07-13 14:56:48,073 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 36 [2022-07-13 14:56:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:48,074 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-07-13 14:56:48,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 14:56:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-07-13 14:56:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 14:56:48,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:48,075 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:48,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 14:56:48,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash -827934680, now seen corresponding path program 1 times [2022-07-13 14:56:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:48,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897194462] [2022-07-13 14:56:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 14:56:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 14:56:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 14:56:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:48,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897194462] [2022-07-13 14:56:48,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897194462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:48,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313797121] [2022-07-13 14:56:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:48,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:48,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:48,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:56:48,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 14:56:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:48,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-13 14:56:48,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:48,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 14:56:48,394 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 14:56:48,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 14:56:48,420 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-13 14:56:48,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-13 14:56:48,425 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 10 treesize of output 9 [2022-07-13 14:56:48,432 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 16 treesize of output 15 [2022-07-13 14:56:48,484 INFO L356 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-07-13 14:56:48,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 46 [2022-07-13 14:56:48,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-13 14:56:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 14:56:48,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:56:48,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:56:48,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 127 [2022-07-13 14:56:48,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-07-13 14:56:48,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2022-07-13 14:56:48,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-13 14:56:48,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-13 14:56:48,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 14:56:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 14:56:48,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313797121] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:56:48,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:56:48,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2022-07-13 14:56:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493599401] [2022-07-13 14:56:48,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:56:48,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 14:56:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 14:56:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-13 14:56:48,807 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-13 14:56:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:56:49,212 INFO L93 Difference]: Finished difference Result 172 states and 253 transitions. [2022-07-13 14:56:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 14:56:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2022-07-13 14:56:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:56:49,214 INFO L225 Difference]: With dead ends: 172 [2022-07-13 14:56:49,214 INFO L226 Difference]: Without dead ends: 131 [2022-07-13 14:56:49,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-07-13 14:56:49,215 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 123 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:56:49,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 517 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 480 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2022-07-13 14:56:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-13 14:56:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 86. [2022-07-13 14:56:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 69 states have internal predecessors, (88), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2022-07-13 14:56:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2022-07-13 14:56:49,225 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 46 [2022-07-13 14:56:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:56:49,225 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2022-07-13 14:56:49,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-13 14:56:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2022-07-13 14:56:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 14:56:49,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:56:49,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:56:49,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 14:56:49,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:49,439 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:56:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:56:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2022-07-13 14:56:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:56:49,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302170562] [2022-07-13 14:56:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:56:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:56:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:56:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:56:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 14:56:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:56:49,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302170562] [2022-07-13 14:56:49,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302170562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:56:49,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327237085] [2022-07-13 14:56:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:56:49,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:56:49,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:56:49,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:56:49,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 14:56:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:56:49,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 14:56:49,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:56:49,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:49,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:56:49,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:49,903 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 23 treesize of output 23 [2022-07-13 14:56:49,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:49,910 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 19 treesize of output 23 [2022-07-13 14:56:49,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:49,913 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 23 treesize of output 23 [2022-07-13 14:56:50,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:50,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:50,366 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 14:56:50,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 52 [2022-07-13 14:56:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:56:50,373 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 43 treesize of output 25 [2022-07-13 14:56:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:56:53,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:56:53,283 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 10 treesize of output 4 [2022-07-13 14:56:53,434 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 10 treesize of output 4 [2022-07-13 14:56:53,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:53,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:56:53,738 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 174 [2022-07-13 14:56:53,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:53,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:56:53,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 109 [2022-07-13 14:56:53,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:56:53,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 700 treesize of output 686 [2022-07-13 14:56:53,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:53,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 876 treesize of output 822 [2022-07-13 14:56:53,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 814 treesize of output 792 [2022-07-13 14:56:53,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:56:53,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:56:53,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 986 treesize of output 872 [2022-07-13 14:56:55,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-13 14:56:55,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-13 14:56:55,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-13 14:56:56,040 INFO L356 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-07-13 14:56:56,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 222 [2022-07-13 14:56:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 14:56:56,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327237085] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:56:56,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:56:56,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-07-13 14:56:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061488576] [2022-07-13 14:56:56,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:56:56,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 14:56:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:56:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 14:56:56,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1559, Unknown=6, NotChecked=0, Total=1722 [2022-07-13 14:56:56,646 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 14:57:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:57:00,779 INFO L93 Difference]: Finished difference Result 272 states and 405 transitions. [2022-07-13 14:57:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 14:57:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Word has length 43 [2022-07-13 14:57:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:57:00,781 INFO L225 Difference]: With dead ends: 272 [2022-07-13 14:57:00,781 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 14:57:00,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=481, Invalid=4065, Unknown=10, NotChecked=0, Total=4556 [2022-07-13 14:57:00,783 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 379 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:57:00,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1353 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1476 Invalid, 0 Unknown, 383 Unchecked, 1.2s Time] [2022-07-13 14:57:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 14:57:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2022-07-13 14:57:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 89 states have internal predecessors, (107), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (30), 14 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-13 14:57:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2022-07-13 14:57:00,796 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 43 [2022-07-13 14:57:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:57:00,796 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2022-07-13 14:57:00,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 41 states have internal predecessors, (77), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-13 14:57:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2022-07-13 14:57:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 14:57:00,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:57:00,797 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:57:00,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 14:57:01,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:01,014 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:57:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:57:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1251374562, now seen corresponding path program 1 times [2022-07-13 14:57:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:57:01,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097673850] [2022-07-13 14:57:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:57:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:57:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:57:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 14:57:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:57:01,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097673850] [2022-07-13 14:57:01,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097673850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:57:01,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:57:01,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:57:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582003957] [2022-07-13 14:57:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:57:01,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:57:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:57:01,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:57:01,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:57:01,105 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 14:57:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:57:01,155 INFO L93 Difference]: Finished difference Result 134 states and 189 transitions. [2022-07-13 14:57:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 14:57:01,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-13 14:57:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:57:01,156 INFO L225 Difference]: With dead ends: 134 [2022-07-13 14:57:01,156 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 14:57:01,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:57:01,157 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:57:01,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 331 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:57:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 14:57:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2022-07-13 14:57:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 91 states have internal predecessors, (109), 16 states have call successors, (16), 6 states have call predecessors, (16), 12 states have return successors, (39), 15 states have call predecessors, (39), 15 states have call successors, (39) [2022-07-13 14:57:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2022-07-13 14:57:01,166 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 44 [2022-07-13 14:57:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:57:01,166 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2022-07-13 14:57:01,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 14:57:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2022-07-13 14:57:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 14:57:01,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:57:01,167 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:57:01,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 14:57:01,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:57:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:57:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -13848694, now seen corresponding path program 1 times [2022-07-13 14:57:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:57:01,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782881498] [2022-07-13 14:57:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:57:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:57:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:57:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 14:57:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:57:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782881498] [2022-07-13 14:57:01,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782881498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:57:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662145247] [2022-07-13 14:57:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:57:01,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:57:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 14:57:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:01,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-13 14:57:01,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:57:01,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:01,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:57:01,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:01,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 14:57:01,667 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 24 treesize of output 12 [2022-07-13 14:57:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 14:57:01,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:57:01,727 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 10 treesize of output 4 [2022-07-13 14:57:01,841 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-13 14:57:01,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-13 14:57:01,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-13 14:57:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 14:57:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 14:57:01,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662145247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:57:01,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:57:01,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2022-07-13 14:57:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133283150] [2022-07-13 14:57:01,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:57:01,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 14:57:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:57:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 14:57:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2022-07-13 14:57:01,904 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 14:57:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:57:03,193 INFO L93 Difference]: Finished difference Result 238 states and 355 transitions. [2022-07-13 14:57:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 14:57:03,193 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 43 [2022-07-13 14:57:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:57:03,195 INFO L225 Difference]: With dead ends: 238 [2022-07-13 14:57:03,195 INFO L226 Difference]: Without dead ends: 157 [2022-07-13 14:57:03,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=415, Invalid=2237, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 14:57:03,197 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 315 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:57:03,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 937 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 895 Invalid, 0 Unknown, 76 Unchecked, 0.5s Time] [2022-07-13 14:57:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-13 14:57:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2022-07-13 14:57:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 111 states have internal predecessors, (131), 22 states have call successors, (22), 9 states have call predecessors, (22), 14 states have return successors, (49), 20 states have call predecessors, (49), 20 states have call successors, (49) [2022-07-13 14:57:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2022-07-13 14:57:03,213 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 43 [2022-07-13 14:57:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:57:03,213 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2022-07-13 14:57:03,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 27 states have internal predecessors, (67), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 14:57:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2022-07-13 14:57:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 14:57:03,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:57:03,214 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:57:03,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 14:57:03,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 14:57:03,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:57:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:57:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1248112818, now seen corresponding path program 2 times [2022-07-13 14:57:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:57:03,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007167600] [2022-07-13 14:57:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:57:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 14:57:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 14:57:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 14:57:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:57:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007167600] [2022-07-13 14:57:03,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007167600] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:57:03,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974630187] [2022-07-13 14:57:03,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 14:57:03,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:03,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:57:03,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:57:03,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 14:57:03,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 14:57:03,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 14:57:03,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-13 14:57:03,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:57:03,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 14:57:04,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:04,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:57:04,004 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:57:04,013 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 14:57:04,013 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 23 treesize of output 27 [2022-07-13 14:57:04,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:04,022 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 13 treesize of output 7 [2022-07-13 14:57:04,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:04,031 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:57:04,041 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 14:57:04,041 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 23 treesize of output 27 [2022-07-13 14:57:04,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:04,046 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 13 treesize of output 7 [2022-07-13 14:57:04,149 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 14:57:04,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 14:57:04,213 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 14:57:04,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-13 14:57:04,243 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 14:57:04,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-13 14:57:04,316 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 14:57:04,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 14:57:04,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:04,366 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 14:57:04,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 50 [2022-07-13 14:57:04,384 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 14:57:04,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-13 14:57:04,401 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-13 14:57:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 53 [2022-07-13 14:57:04,424 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 14:57:04,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 7 [2022-07-13 14:57:05,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:05,829 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 14:57:05,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 26 [2022-07-13 14:57:05,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:05,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 15 [2022-07-13 14:57:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 14:57:05,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:57:05,979 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 10 treesize of output 4 [2022-07-13 14:57:06,464 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:57:06,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:57:06,468 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-13 14:57:06,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:57:06,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 284 treesize of output 262 [2022-07-13 14:57:06,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2022-07-13 14:57:06,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2022-07-13 14:57:06,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 182 [2022-07-13 14:57:06,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:57:06,522 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-13 14:57:06,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-07-13 14:57:06,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 14:57:06,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:57:06,587 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 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-13 14:57:06,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:57:06,590 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 68 treesize of output 56 [2022-07-13 14:57:06,597 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 14:57:06,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2022-07-13 14:57:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 14:57:06,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974630187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:57:06,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:57:06,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 33 [2022-07-13 14:57:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791982434] [2022-07-13 14:57:06,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:57:06,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 14:57:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:57:06,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 14:57:06,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=899, Unknown=5, NotChecked=0, Total=1056 [2022-07-13 14:57:06,604 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-13 14:57:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:57:07,422 INFO L93 Difference]: Finished difference Result 255 states and 358 transitions. [2022-07-13 14:57:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 14:57:07,424 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 49 [2022-07-13 14:57:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:57:07,425 INFO L225 Difference]: With dead ends: 255 [2022-07-13 14:57:07,425 INFO L226 Difference]: Without dead ends: 214 [2022-07-13 14:57:07,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=357, Invalid=1707, Unknown=6, NotChecked=0, Total=2070 [2022-07-13 14:57:07,426 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 147 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:57:07,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 788 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 387 Invalid, 0 Unknown, 331 Unchecked, 0.2s Time] [2022-07-13 14:57:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-13 14:57:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2022-07-13 14:57:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 130 states have internal predecessors, (151), 23 states have call successors, (23), 12 states have call predecessors, (23), 19 states have return successors, (51), 22 states have call predecessors, (51), 21 states have call successors, (51) [2022-07-13 14:57:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 225 transitions. [2022-07-13 14:57:07,440 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 225 transitions. Word has length 49 [2022-07-13 14:57:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:57:07,440 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 225 transitions. [2022-07-13 14:57:07,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 32 states have internal predecessors, (80), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-13 14:57:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 225 transitions. [2022-07-13 14:57:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 14:57:07,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:57:07,441 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:57:07,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 14:57:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:07,659 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:57:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:57:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2022-07-13 14:57:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:57:07,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40601661] [2022-07-13 14:57:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:57:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:57:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:57:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 14:57:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 14:57:07,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:57:07,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40601661] [2022-07-13 14:57:07,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40601661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:57:07,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563612703] [2022-07-13 14:57:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:07,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:07,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:57:07,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:57:07,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 14:57:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:07,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 14:57:07,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:57:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:57:07,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:57:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 14:57:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563612703] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:57:07,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:57:07,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-13 14:57:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943190053] [2022-07-13 14:57:07,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:57:07,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 14:57:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:57:07,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 14:57:07,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 14:57:07,894 INFO L87 Difference]: Start difference. First operand 165 states and 225 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-13 14:57:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:57:08,028 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2022-07-13 14:57:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:57:08,029 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2022-07-13 14:57:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:57:08,029 INFO L225 Difference]: With dead ends: 227 [2022-07-13 14:57:08,030 INFO L226 Difference]: Without dead ends: 157 [2022-07-13 14:57:08,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-13 14:57:08,030 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 121 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:57:08,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 148 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 14:57:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-13 14:57:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-07-13 14:57:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 118 states have internal predecessors, (134), 21 states have call successors, (21), 12 states have call predecessors, (21), 18 states have return successors, (47), 21 states have call predecessors, (47), 19 states have call successors, (47) [2022-07-13 14:57:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2022-07-13 14:57:08,042 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 46 [2022-07-13 14:57:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:57:08,042 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2022-07-13 14:57:08,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-13 14:57:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2022-07-13 14:57:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 14:57:08,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:57:08,043 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:57:08,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 14:57:08,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:08,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:57:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:57:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2022-07-13 14:57:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:57:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692157649] [2022-07-13 14:57:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:57:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:57:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:57:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:57:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:57:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:57:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 14:57:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:57:08,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692157649] [2022-07-13 14:57:08,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692157649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:57:08,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590654376] [2022-07-13 14:57:08,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 14:57:08,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:57:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:57:08,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:57:08,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 14:57:08,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 14:57:08,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 14:57:08,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-13 14:57:08,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:57:08,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:08,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:57:08,687 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 14:57:08,688 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 14 treesize of output 20 [2022-07-13 14:57:08,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 14:57:08,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:08,706 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:57:08,716 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 14:57:08,717 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 14 treesize of output 20 [2022-07-13 14:57:08,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 14:57:08,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:08,953 INFO L356 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-07-13 14:57:08,953 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 82 [2022-07-13 14:57:08,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:57:08,976 INFO L356 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2022-07-13 14:57:08,976 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2022-07-13 14:57:31,132 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:57:37,246 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:57:45,352 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:57:51,446 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:57:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 14:57:54,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:57:54,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590654376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:57:54,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:57:54,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 33 [2022-07-13 14:57:54,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825911982] [2022-07-13 14:57:54,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:57:54,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 14:57:54,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:57:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 14:57:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=996, Unknown=8, NotChecked=0, Total=1122 [2022-07-13 14:57:54,723 INFO L87 Difference]: Start difference. First operand 152 states and 202 transitions. Second operand has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 14:58:07,290 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:58:13,378 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:58:21,987 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 65 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 14:58:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:22,082 INFO L93 Difference]: Finished difference Result 244 states and 326 transitions. [2022-07-13 14:58:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 14:58:22,083 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2022-07-13 14:58:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:22,083 INFO L225 Difference]: With dead ends: 244 [2022-07-13 14:58:22,084 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 14:58:22,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 72.5s TimeCoverageRelationStatistics Valid=284, Invalid=2055, Unknown=13, NotChecked=0, Total=2352 [2022-07-13 14:58:22,085 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:22,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 407 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-07-13 14:58:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 14:58:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2022-07-13 14:58:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 15 states have call successors, (15), 11 states have call predecessors, (15), 13 states have return successors, (25), 14 states have call predecessors, (25), 14 states have call successors, (25) [2022-07-13 14:58:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-07-13 14:58:22,096 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 50 [2022-07-13 14:58:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:22,096 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-07-13 14:58:22,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 31 states have internal predecessors, (54), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 14:58:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-07-13 14:58:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 14:58:22,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:22,097 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:22,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 14:58:22,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 14:58:22,298 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2022-07-13 14:58:22,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:22,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186204733] [2022-07-13 14:58:22,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:22,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:58:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 14:58:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 14:58:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 14:58:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:22,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186204733] [2022-07-13 14:58:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186204733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798597523] [2022-07-13 14:58:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:58:22,603 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:58:22,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 14:58:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:22,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-13 14:58:22,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:58:22,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:22,786 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 19 treesize of output 23 [2022-07-13 14:58:22,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:22,791 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 19 treesize of output 23 [2022-07-13 14:58:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:22,808 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 16 treesize of output 18 [2022-07-13 14:58:22,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:22,813 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 23 treesize of output 23 [2022-07-13 14:58:23,097 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 14:58:23,098 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 1 case distinctions, treesize of input 39 treesize of output 38 [2022-07-13 14:58:23,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:23,102 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 20 treesize of output 22 [2022-07-13 14:58:23,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:23,317 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 28 treesize of output 12 [2022-07-13 14:58:23,320 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 19 treesize of output 7 [2022-07-13 14:58:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 14:58:23,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:58:23,413 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1302 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) v_ArrVal_1302) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0))) is different from false [2022-07-13 14:58:23,426 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1303 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (forall ((v_ArrVal_1302 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1302) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0))) is different from false [2022-07-13 14:58:23,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798597523] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:23,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:58:23,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2022-07-13 14:58:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432578107] [2022-07-13 14:58:23,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:58:23,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 14:58:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:58:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 14:58:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=402, Unknown=2, NotChecked=82, Total=552 [2022-07-13 14:58:23,442 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-13 14:58:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:24,575 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2022-07-13 14:58:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 14:58:24,575 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 53 [2022-07-13 14:58:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:24,576 INFO L225 Difference]: With dead ends: 167 [2022-07-13 14:58:24,576 INFO L226 Difference]: Without dead ends: 142 [2022-07-13 14:58:24,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=1266, Unknown=2, NotChecked=154, Total=1722 [2022-07-13 14:58:24,577 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 155 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:24,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 437 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 398 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-13 14:58:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-13 14:58:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2022-07-13 14:58:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 99 states have internal predecessors, (110), 15 states have call successors, (15), 11 states have call predecessors, (15), 13 states have return successors, (25), 14 states have call predecessors, (25), 14 states have call successors, (25) [2022-07-13 14:58:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2022-07-13 14:58:24,595 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 53 [2022-07-13 14:58:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:24,596 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2022-07-13 14:58:24,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 6 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-13 14:58:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-07-13 14:58:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 14:58:24,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:24,597 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:24,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 14:58:24,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 14:58:24,812 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:24,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2022-07-13 14:58:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:24,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963589836] [2022-07-13 14:58:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:58:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:24,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 14:58:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 14:58:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 14:58:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:25,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963589836] [2022-07-13 14:58:25,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963589836] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:25,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971462351] [2022-07-13 14:58:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:25,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:58:25,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:58:25,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 14:58:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:25,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-13 14:58:25,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:58:25,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:25,240 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 19 treesize of output 23 [2022-07-13 14:58:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:25,245 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 23 treesize of output 23 [2022-07-13 14:58:25,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:25,254 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 19 treesize of output 23 [2022-07-13 14:58:25,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:25,257 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 23 treesize of output 23 [2022-07-13 14:58:25,639 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 14:58:25,639 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 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-13 14:58:25,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:25,643 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 44 treesize of output 42 [2022-07-13 14:58:26,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:26,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:26,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:58:26,158 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 14:58:26,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2022-07-13 14:58:26,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:26,164 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 34 treesize of output 20 [2022-07-13 14:58:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:58:30,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:58:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971462351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:31,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:58:31,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2022-07-13 14:58:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497547217] [2022-07-13 14:58:31,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:58:31,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 14:58:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:58:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 14:58:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1463, Unknown=11, NotChecked=0, Total=1640 [2022-07-13 14:58:31,131 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-13 14:58:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:33,513 INFO L93 Difference]: Finished difference Result 215 states and 257 transitions. [2022-07-13 14:58:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 14:58:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2022-07-13 14:58:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:33,515 INFO L225 Difference]: With dead ends: 215 [2022-07-13 14:58:33,515 INFO L226 Difference]: Without dead ends: 208 [2022-07-13 14:58:33,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=390, Invalid=2901, Unknown=15, NotChecked=0, Total=3306 [2022-07-13 14:58:33,516 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 120 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:33,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 557 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 326 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2022-07-13 14:58:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-13 14:58:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 199. [2022-07-13 14:58:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.103225806451613) internal successors, (171), 158 states have internal predecessors, (171), 23 states have call successors, (23), 16 states have call predecessors, (23), 20 states have return successors, (41), 24 states have call predecessors, (41), 22 states have call successors, (41) [2022-07-13 14:58:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2022-07-13 14:58:33,533 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 235 transitions. Word has length 53 [2022-07-13 14:58:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:33,533 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 235 transitions. [2022-07-13 14:58:33,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-13 14:58:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 235 transitions. [2022-07-13 14:58:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 14:58:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:33,534 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:33,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 14:58:33,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 14:58:33,747 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2022-07-13 14:58:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:33,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570773706] [2022-07-13 14:58:33,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:58:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 14:58:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 14:58:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 14:58:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:33,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570773706] [2022-07-13 14:58:33,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570773706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:33,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409531162] [2022-07-13 14:58:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:33,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:33,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:58:33,852 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:58:33,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 14:58:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:33,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 14:58:34,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:58:34,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:34,043 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 19 treesize of output 23 [2022-07-13 14:58:34,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:34,046 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 23 treesize of output 23 [2022-07-13 14:58:34,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:34,240 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-07-13 14:58:34,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:34,243 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 34 treesize of output 20 [2022-07-13 14:58:34,400 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 16 treesize of output 8 [2022-07-13 14:58:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 14:58:34,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:58:34,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 14:58:34,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2022-07-13 14:58:34,614 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-13 14:58:34,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-13 14:58:34,618 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 14:58:34,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-07-13 14:58:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-13 14:58:34,634 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-13 14:58:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-07-13 14:58:34,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:58:34,639 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 14:58:34,639 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 1 case distinctions, treesize of input 29 treesize of output 15 [2022-07-13 14:58:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 14:58:34,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409531162] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 14:58:34,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 14:58:34,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 27 [2022-07-13 14:58:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169690812] [2022-07-13 14:58:34,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 14:58:34,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 14:58:34,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:58:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 14:58:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-13 14:58:34,694 INFO L87 Difference]: Start difference. First operand 199 states and 235 transitions. Second operand has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-13 14:58:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:35,192 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2022-07-13 14:58:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 14:58:35,193 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 53 [2022-07-13 14:58:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:35,194 INFO L225 Difference]: With dead ends: 223 [2022-07-13 14:58:35,194 INFO L226 Difference]: Without dead ends: 198 [2022-07-13 14:58:35,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 14:58:35,195 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 71 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:35,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 426 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-13 14:58:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-13 14:58:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 122. [2022-07-13 14:58:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 96 states have internal predecessors, (105), 13 states have call successors, (13), 12 states have call predecessors, (13), 15 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-13 14:58:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2022-07-13 14:58:35,210 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 53 [2022-07-13 14:58:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:35,210 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2022-07-13 14:58:35,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-13 14:58:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2022-07-13 14:58:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 14:58:35,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:35,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:35,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 14:58:35,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:35,427 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2022-07-13 14:58:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:35,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125013474] [2022-07-13 14:58:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:58:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 14:58:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 14:58:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 14:58:35,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:35,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125013474] [2022-07-13 14:58:35,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125013474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:58:35,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:58:35,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:58:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884095181] [2022-07-13 14:58:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:58:35,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:58:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:58:35,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:58:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:58:35,496 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 14:58:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:35,526 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-07-13 14:58:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:58:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2022-07-13 14:58:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:35,527 INFO L225 Difference]: With dead ends: 132 [2022-07-13 14:58:35,528 INFO L226 Difference]: Without dead ends: 122 [2022-07-13 14:58:35,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:58:35,529 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:35,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:58:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-13 14:58:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2022-07-13 14:58:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.120879120879121) internal successors, (102), 95 states have internal predecessors, (102), 13 states have call successors, (13), 11 states have call predecessors, (13), 15 states have return successors, (24), 13 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-13 14:58:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-07-13 14:58:35,540 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 59 [2022-07-13 14:58:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:35,540 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-07-13 14:58:35,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 14:58:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-07-13 14:58:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 14:58:35,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:35,541 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:35,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 14:58:35,541 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2022-07-13 14:58:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:35,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352715127] [2022-07-13 14:58:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:58:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 14:58:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 14:58:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 14:58:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:35,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352715127] [2022-07-13 14:58:35,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352715127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:35,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835937196] [2022-07-13 14:58:35,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 14:58:35,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:58:35,789 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:58:35,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 14:58:35,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 14:58:35,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 14:58:35,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 108 conjunts are in the unsatisfiable core [2022-07-13 14:58:35,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:58:36,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:58:36,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 14:58:36,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,033 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 14:58:36,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 14:58:36,369 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 14:58:36,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-13 14:58:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-07-13 14:58:36,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 14:58:36,758 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 14:58:36,758 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 60 [2022-07-13 14:58:36,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:36,766 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-07-13 14:58:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:58:37,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:58:37,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835937196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:37,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:58:37,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2022-07-13 14:58:37,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643551100] [2022-07-13 14:58:37,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:58:37,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 14:58:37,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:58:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 14:58:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1302, Unknown=1, NotChecked=0, Total=1482 [2022-07-13 14:58:37,920 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-13 14:58:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:38,490 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2022-07-13 14:58:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 14:58:38,490 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) Word has length 60 [2022-07-13 14:58:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:38,491 INFO L225 Difference]: With dead ends: 136 [2022-07-13 14:58:38,491 INFO L226 Difference]: Without dead ends: 131 [2022-07-13 14:58:38,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=352, Invalid=2617, Unknown=1, NotChecked=0, Total=2970 [2022-07-13 14:58:38,492 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 76 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:38,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 457 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-07-13 14:58:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-13 14:58:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2022-07-13 14:58:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.118279569892473) internal successors, (104), 97 states have internal predecessors, (104), 13 states have call successors, (13), 11 states have call predecessors, (13), 16 states have return successors, (25), 14 states have call predecessors, (25), 12 states have call successors, (25) [2022-07-13 14:58:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2022-07-13 14:58:38,504 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 60 [2022-07-13 14:58:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:38,504 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2022-07-13 14:58:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 30 states have internal predecessors, (81), 11 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-13 14:58:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-07-13 14:58:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 14:58:38,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:38,505 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:38,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 14:58:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 14:58:38,711 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2093349375, now seen corresponding path program 1 times [2022-07-13 14:58:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:38,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452710912] [2022-07-13 14:58:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 14:58:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 14:58:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 14:58:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 14:58:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:38,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452710912] [2022-07-13 14:58:38,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452710912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:38,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932466097] [2022-07-13 14:58:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:58:38,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:58:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 14:58:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:38,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 14:58:38,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:58:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 14:58:38,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:58:38,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932466097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:58:38,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 14:58:38,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-07-13 14:58:38,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025009894] [2022-07-13 14:58:38,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:58:38,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:58:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:58:38,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:58:38,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:58:38,950 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 14:58:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:58:38,974 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-07-13 14:58:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:58:38,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2022-07-13 14:58:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:58:38,975 INFO L225 Difference]: With dead ends: 140 [2022-07-13 14:58:38,975 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 14:58:38,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:58:38,976 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:58:38,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 219 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:58:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 14:58:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-07-13 14:58:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 67 states have internal predecessors, (74), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-13 14:58:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-07-13 14:58:38,989 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 68 [2022-07-13 14:58:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:58:38,989 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-07-13 14:58:38,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 14:58:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-07-13 14:58:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 14:58:38,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:58:38,990 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:58:39,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 14:58:39,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 14:58:39,203 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:58:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:58:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1013838843, now seen corresponding path program 4 times [2022-07-13 14:58:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:58:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108162963] [2022-07-13 14:58:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:58:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:58:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 14:58:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 14:58:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 14:58:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 14:58:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 14:58:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:58:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 14:58:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:58:39,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108162963] [2022-07-13 14:58:39,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108162963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:58:39,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420872340] [2022-07-13 14:58:39,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 14:58:39,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:58:39,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:58:39,476 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 14:58:39,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 14:58:39,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 14:58:39,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 14:58:39,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2022-07-13 14:58:39,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:58:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:39,691 INFO L356 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2022-07-13 14:58:39,691 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 2 case distinctions, treesize of input 39 treesize of output 36 [2022-07-13 14:58:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:39,715 INFO L356 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-07-13 14:58:39,716 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 2 case distinctions, treesize of input 63 treesize of output 52 [2022-07-13 14:58:40,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:40,850 INFO L356 Elim1Store]: treesize reduction 239, result has 20.6 percent of original size [2022-07-13 14:58:40,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 165 [2022-07-13 14:58:40,896 INFO L356 Elim1Store]: treesize reduction 171, result has 20.5 percent of original size [2022-07-13 14:58:40,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 131 [2022-07-13 14:58:43,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:43,419 INFO L356 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-07-13 14:58:43,419 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 131 [2022-07-13 14:58:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:58:43,442 INFO L356 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-07-13 14:58:43,442 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 116 [2022-07-13 14:58:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 14:58:48,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:59:22,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420872340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 14:59:22,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 14:59:22,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2022-07-13 14:59:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262104016] [2022-07-13 14:59:22,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 14:59:22,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 14:59:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:59:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 14:59:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1462, Unknown=10, NotChecked=0, Total=1640 [2022-07-13 14:59:22,875 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 32 states, 29 states have (on average 3.0) internal successors, (87), 31 states have internal predecessors, (87), 13 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-13 14:59:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:59:24,870 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-13 14:59:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 14:59:24,871 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.0) internal successors, (87), 31 states have internal predecessors, (87), 13 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 67 [2022-07-13 14:59:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:59:24,871 INFO L225 Difference]: With dead ends: 132 [2022-07-13 14:59:24,871 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:59:24,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=503, Invalid=4317, Unknown=10, NotChecked=0, Total=4830 [2022-07-13 14:59:24,873 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 140 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:59:24,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 536 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 280 Invalid, 0 Unknown, 172 Unchecked, 0.2s Time] [2022-07-13 14:59:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:59:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:59:24,874 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-07-13 14:59:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:59:24,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2022-07-13 14:59:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:59:24,874 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:59:24,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.0) internal successors, (87), 31 states have internal predecessors, (87), 13 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-13 14:59:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:59:24,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:59:24,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:59:24,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 14:59:25,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 14:59:25,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:00:06,430 WARN L233 SmtUtils]: Spent 41.23s on a formula simplification. DAG size of input: 244 DAG size of output: 228 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 15:00:19,786 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 215 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 15:00:37,160 WARN L233 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 511 DAG size of output: 173 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-13 15:00:37,775 INFO L895 garLoopResultBuilder]: At program point L622(line 622) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse3 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse4 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= |ULTIMATE.start_re_insert_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (< (+ |ULTIMATE.start_main_~n~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) .cse0 (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (= |ULTIMATE.start_re_insert_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (exists ((|ULTIMATE.start_re_insert_~x#1.base| Int)) (let ((.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_re_insert_~x#1.base|))) (let ((.cse2 (select .cse1 |ULTIMATE.start_main_~x~0#1.offset|))) (and (< (+ |ULTIMATE.start_re_insert_~x#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse1 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_re_insert_~x#1.base| 0)) (not (= .cse2 0)) (= |ULTIMATE.start_re_insert_~x#1.base| (select (select |#memory_$Pointer$.base| .cse2) (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (= |ULTIMATE.start_main_~#list~0#1.base| .cse2))))) .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) .cse4) |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (not (= (select (select (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (select .cse7 |ULTIMATE.start_main_~x~0#1.offset|))) (store |#memory_$Pointer$.base| .cse5 (store (select |#memory_$Pointer$.base| .cse5) (+ (select .cse6 |ULTIMATE.start_main_~x~0#1.offset|) 4) (select .cse7 .cse8))))) |ULTIMATE.start_main_~#list~0#1.base|) .cse4) |ULTIMATE.start_main_~x~0#1.base|)) (= 0 (select .cse6 .cse8)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) .cse4) |ULTIMATE.start_main_~x~0#1.offset|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) .cse0 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) .cse3))) [2022-07-13 15:00:37,775 INFO L895 garLoopResultBuilder]: At program point L622-1(line 622) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret22#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L622-2(line 622) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 582) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 611) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L902 garLoopResultBuilder]: At program point L623(lines 601 624) the Hoare annotation is: true [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 591) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2022-07-13 15:00:37,776 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 616) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L895 garLoopResultBuilder]: At program point L615-2(lines 607 617) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse42 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse43 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse32 (select .cse43 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse30 (select .cse43 .cse42)) (.cse38 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse6 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse28 (select .cse27 .cse42)) (.cse40 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse39 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse41 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|))) (let ((.cse3 (select .cse27 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse13 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (.cse22 (< 0 |#StackHeapBarrier|)) (.cse4 (= (select .cse41 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)) (.cse16 (not (= |ULTIMATE.start_main_~n~0#1.base| 0))) (.cse17 (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse39 |ULTIMATE.start_main_~n~0#1.offset|))) (.cse19 (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)) (.cse2 (= (select .cse41 .cse40) 0)) (.cse9 (+ |ULTIMATE.start_main_~n~0#1.base| 1)) (.cse11 (= (select .cse39 .cse40) 0)) (.cse20 (= |ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse8 (= .cse28 0)) (.cse24 (select .cse38 .cse6)) (.cse10 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|)) (.cse14 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse15 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse18 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse21 (= 0 .cse30)) (.cse23 (= .cse32 |ULTIMATE.start_main_~#list~0#1.offset|))) (or (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) .cse6))) (let ((.cse5 (select |#memory_$Pointer$.offset| .cse24)) (.cse7 (= |ULTIMATE.start_main_~#list~0#1.base| .cse24)) (.cse0 (select |#memory_$Pointer$.base| .cse24)) (.cse12 (+ .cse1 4))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse0 .cse1)) .cse2 (= |ULTIMATE.start_main_~tail~0#1.base| .cse3) .cse4 (or (= |ULTIMATE.start_main_~#list~0#1.offset| (select .cse5 .cse1)) (and (= .cse1 .cse6) .cse7)) .cse8 (< .cse9 |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) .cse10 (= |ULTIMATE.start_main_~n~0#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) .cse11 (= (select .cse5 .cse12) 0) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) .cse3) .cse13 .cse14 .cse15 .cse16 (or (and (= .cse1 |ULTIMATE.start_main_~#list~0#1.offset|) .cse7) (= (select .cse0 .cse12) 0)) .cse17 (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) (and (let ((.cse25 (let ((.cse33 (let ((.cse35 (not (= .cse24 |ULTIMATE.start_main_~x~0#1.base|)))) (let ((.cse34 (let ((.cse36 (let ((.cse37 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse2 .cse37 (< .cse9 |ULTIMATE.start_main_~tail~0#1.base|) .cse11 .cse20) (and .cse37 .cse8 (= (select .cse38 |ULTIMATE.start_main_~#list~0#1.offset|) 0)))))) (or (and .cse36 .cse19) (and .cse36 .cse35))))) (or (and .cse34 .cse35) (and .cse4 .cse34 .cse16 .cse17)))))) (or (and (or (and (= .cse3 0) (= .cse28 .cse3)) (let ((.cse29 (+ .cse32 4))) (let ((.cse31 (select (select |#memory_$Pointer$.base| .cse3) .cse29))) (and (= (select (select |#memory_$Pointer$.offset| .cse3) .cse29) .cse30) (= .cse31 0) (= .cse28 .cse31))))) .cse13 .cse33 .cse22) (and .cse4 .cse13 .cse33 .cse17 .cse22)))) (.cse26 (= |ULTIMATE.start_main_~x~0#1.offset| 0))) (or (and .cse25 .cse26 (= (select .cse27 .cse6) 0)) (and .cse25 .cse26 .cse16))) .cse10 .cse14 .cse15 .cse18 .cse21 .cse23))))) [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 617) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse26 (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse0 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (< |#StackHeapBarrier| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse7 (= (select .cse25 .cse26) 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse4 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse2 (+ |ULTIMATE.start_main_~n~0#1.base| 1)) (.cse6 (= |ULTIMATE.start_main_~n~0#1.offset| 0)) (.cse10 (= 0 (select .cse23 .cse26))) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|)) (.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|))) (or (and .cse0 .cse1 (< .cse2 |ULTIMATE.start_main_~tail~0#1.base|) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select .cse8 |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select .cse9 |ULTIMATE.start_main_~#list~0#1.offset|) 0) .cse4 .cse5 .cse10) (let ((.cse17 (+ |ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|)) (.cse12 (select .cse9 .cse17)) (.cse24 (select .cse8 .cse17))) (let ((.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|)) (.cse14 (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) (.cse16 (select |#memory_$Pointer$.offset| .cse24)) (.cse15 (select .cse25 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse18 (= |ULTIMATE.start_main_~#list~0#1.base| .cse24)) (.cse11 (select |#memory_$Pointer$.base| .cse24)) (.cse21 (+ .cse12 4)) (.cse22 (select .cse20 |ULTIMATE.start_main_~n~0#1.offset|)) (.cse19 (select .cse23 |ULTIMATE.start_main_~x~0#1.offset|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse11 .cse12)) (= (select .cse13 .cse14) 0) (= |ULTIMATE.start_main_~tail~0#1.base| .cse15) (= (select .cse13 |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|) (or (= |ULTIMATE.start_main_~#list~0#1.offset| (select .cse16 .cse12)) (and (= .cse12 .cse17) .cse18)) .cse7 (= .cse19 |ULTIMATE.start_main_~tail~0#1.offset|) .cse3 (= |ULTIMATE.start_main_~n~0#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= (select .cse20 .cse14) 0) (= (select .cse16 .cse21) 0) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) .cse15) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) .cse4 .cse5 (< .cse2 .cse22) (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) (or (and (= .cse12 |ULTIMATE.start_main_~#list~0#1.offset|) .cse18) (= (select .cse11 .cse21) 0)) (= |ULTIMATE.start_main_~#list~0#1.base| .cse22) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) .cse6 .cse10 (< 0 |#StackHeapBarrier|) (= .cse19 |ULTIMATE.start_main_~#list~0#1.offset|)))))))) [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L895 garLoopResultBuilder]: At program point L620-2(line 620) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse0 |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_remove_~x#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< (+ |ULTIMATE.start_main_~n~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|) (not |ULTIMATE.start_main_#t~short21#1|) (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (let ((.cse9 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (select .cse9 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse7 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse2 (select .cse6 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ .cse8 4))) (let ((.cse5 (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (.cse4 (select .cse9 .cse7))) (and (= (select (select |#memory_$Pointer$.offset| .cse2) .cse3) .cse4) (= |ULTIMATE.start_main_~#list~0#1.base| .cse2) (= .cse5 0) (= (select .cse6 .cse7) .cse5) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= 0 .cse4) (= .cse8 |ULTIMATE.start_main_~#list~0#1.offset|))))))) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|) 0) (< 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (= 0 (select .cse10 .cse1)) (= (select .cse10 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|))) [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L620-3(line 620) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L895 garLoopResultBuilder]: At program point L620-4(line 620) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0#1.base|))) (or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| .cse0 .cse1 .cse2) (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse11 (select .cse3 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (and (= (select .cse3 .cse4) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (< (+ |ULTIMATE.start_main_~x~0#1.base| 1) |ULTIMATE.start_main_~#list~0#1.base|) (let ((.cse5 (= |ULTIMATE.start_main_~#list~0#1.base| .cse11)) (.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) |ULTIMATE.start_remove_~x#1.offset|)) (.cse6 (+ |ULTIMATE.start_main_~n~0#1.base| 1)) (.cse7 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~tail~0#1.offset|)) (.cse8 (not (= |ULTIMATE.start_main_~x~0#1.base| 0))) (.cse9 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|))) (or (and .cse5 |ULTIMATE.start_main_#t~short21#1| (< .cse6 |ULTIMATE.start_main_~#list~0#1.base|) .cse0 .cse7 .cse1 .cse2 .cse8 .cse9 (< 0 .cse10)) (and .cse5 (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| (not (= .cse10 |ULTIMATE.start_remove_~x#1.base|)) (< .cse6 |ULTIMATE.start_main_~tail~0#1.base|) .cse0 .cse7 .cse1 .cse2 (not (= |ULTIMATE.start_main_~n~0#1.base| 0)) .cse8 .cse9 (= |ULTIMATE.start_main_~n~0#1.offset| 0) (< 0 |#StackHeapBarrier|)))) (not (= .cse11 0)) (= 0 (select .cse12 .cse4)) (= (select .cse12 |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.offset|)))))) [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 584) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L620-5(line 620) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 585) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 589) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 588 589) no Hoare annotation was computed. [2022-07-13 15:00:37,777 INFO L899 garLoopResultBuilder]: For program point L2(lines 2 4) no Hoare annotation was computed. [2022-07-13 15:00:37,778 INFO L902 garLoopResultBuilder]: At program point is_list_containing_xENTRY(lines 593 600) the Hoare annotation is: true [2022-07-13 15:00:37,778 INFO L895 garLoopResultBuilder]: At program point L598(line 598) the Hoare annotation is: (let ((.cse28 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse19 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse28)) (.cse20 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse28))) (let ((.cse0 (forall ((|ULTIMATE.start_main_~x~0#1.base| Int)) (let ((.cse27 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse25 (select .cse27 0)) (.cse26 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse22 (select .cse26 0)) (.cse23 (+ .cse25 4))) (let ((.cse21 (select .cse27 4)) (.cse24 (select (select |#memory_$Pointer$.base| .cse22) .cse23))) (or (not (= .cse21 (select (select |#memory_$Pointer$.offset| .cse22) .cse23))) (not (= .cse21 0)) (not (= .cse24 0)) (not (= .cse25 0)) (not (= (select .cse26 4) .cse24)) (= .cse22 |ULTIMATE.start_main_~x~0#1.base|)))))))) (.cse9 (= .cse20 |is_list_containing_x_#t~mem14.base|)) (.cse1 (= |is_list_containing_x_#t~mem14.offset| .cse19)) (.cse10 (or (not (= .cse19 0)) (not (= .cse20 0))))) (and (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse3 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8|))) (let ((.cse2 (select .cse3 0))) (or (not (< (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 1) .cse2)) (not (= (select (select |#memory_$Pointer$.base| .cse2) 4) 0)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 0) (= .cse2 0) (not (= (select .cse3 4) 0))))))) (or .cse1 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37| Int)) (let ((.cse7 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37|))) (let ((.cse8 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37|)) (.cse6 (select .cse7 0))) (let ((.cse5 (+ .cse6 4)) (.cse4 (select .cse8 0))) (or (not (= (select (select |#memory_$Pointer$.offset| .cse4) .cse5) 0)) (not (= (select (select |#memory_$Pointer$.base| .cse4) .cse5) |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37|)) (not (= .cse6 0)) (not (= (select .cse7 4) 0)) (= 0 .cse4) (not (= (select .cse8 4) 0)) (not (< (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_37| 1) .cse4)))))))) (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or .cse9 (not (< 0 |#StackHeapBarrier|))) (or .cse0 (and .cse9 (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (= |is_list_containing_x_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)))) .cse10)) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (or (and .cse9 .cse1 .cse10) (forall ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse12 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29|) 4)) (.cse16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29|) 4))) (let ((.cse11 (select |#memory_$Pointer$.offset| .cse16)) (.cse15 (select |#memory_$Pointer$.base| .cse16)) (.cse14 (+ .cse12 4)) (.cse13 (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29| .cse16)))) (or (and (not (= (select .cse11 .cse12) 0)) (or .cse13 (not (= .cse12 4)))) (not (= (select .cse11 .cse14) 0)) (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_29| (select .cse15 .cse12))) (and (not (= (select .cse15 .cse14) 0)) (or (not (= .cse12 0)) .cse13)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23| Int)) (let ((.cse18 (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23|)) (.cse17 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23|))) (or (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23| 0) (not (= (select .cse17 4) 0)) (not (= (select .cse18 4) 0)) (not (< (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_23| 1) (select .cse18 0))) (not (= (select .cse17 0) 0)))))) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|))))) [2022-07-13 15:00:37,778 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xFINAL(lines 593 600) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 598) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point L598-1(line 598) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 596) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xEXIT(lines 593 600) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2022-07-13 15:00:37,779 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-07-13 15:00:37,782 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:00:37,783 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:00:37,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,794 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,796 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,797 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,799 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,804 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,808 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,809 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,811 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,815 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,816 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,817 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,818 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,819 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,820 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,822 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,823 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,825 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,826 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,841 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,874 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,877 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,878 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:00:37 BoogieIcfgContainer [2022-07-13 15:00:37,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:00:37,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:00:37,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:00:37,892 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:00:37,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:56:44" (3/4) ... [2022-07-13 15:00:37,895 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 15:00:37,899 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2022-07-13 15:00:37,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 15:00:37,903 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-07-13 15:00:37,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 15:00:37,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 15:00:37,905 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 15:00:37,939 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:00:37,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:00:37,940 INFO L158 Benchmark]: Toolchain (without parser) took 233960.53ms. Allocated memory was 96.5MB in the beginning and 356.5MB in the end (delta: 260.0MB). Free memory was 52.2MB in the beginning and 159.6MB in the end (delta: -107.4MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,940 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:00:37,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.21ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 52.0MB in the beginning and 99.3MB in the end (delta: -47.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 134.2MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,945 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 134.2MB. Free memory was 97.2MB in the beginning and 95.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,945 INFO L158 Benchmark]: RCFGBuilder took 311.92ms. Allocated memory is still 134.2MB. Free memory was 95.6MB in the beginning and 98.3MB in the end (delta: -2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,946 INFO L158 Benchmark]: TraceAbstraction took 233278.45ms. Allocated memory was 134.2MB in the beginning and 356.5MB in the end (delta: 222.3MB). Free memory was 97.5MB in the beginning and 162.8MB in the end (delta: -65.3MB). Peak memory consumption was 208.9MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,946 INFO L158 Benchmark]: Witness Printer took 47.56ms. Allocated memory is still 356.5MB. Free memory was 162.8MB in the beginning and 159.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:00:37,947 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.15ms. Allocated memory is still 96.5MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.21ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 52.0MB in the beginning and 99.3MB in the end (delta: -47.3MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 134.2MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 134.2MB. Free memory was 97.2MB in the beginning and 95.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.92ms. Allocated memory is still 134.2MB. Free memory was 95.6MB in the beginning and 98.3MB in the end (delta: -2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * TraceAbstraction took 233278.45ms. Allocated memory was 134.2MB in the beginning and 356.5MB in the end (delta: 222.3MB). Free memory was 97.5MB in the beginning and 162.8MB in the end (delta: -65.3MB). Peak memory consumption was 208.9MB. Max. memory is 16.1GB. * Witness Printer took 47.56ms. Allocated memory is still 356.5MB. Free memory was 162.8MB in the beginning and 159.6MB 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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * 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: 20]: 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 3 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 233.1s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 72.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2128 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2097 mSDsluCounter, 9778 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1577 IncrementalHoareTripleChecker+Unchecked, 8507 mSDsCounter, 1078 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5859 IncrementalHoareTripleChecker+Invalid, 8514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1078 mSolverCounterUnsat, 1271 mSDtfsCounter, 5859 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1850 GetRequests, 1221 SyntacticMatches, 37 SemanticMatches, 592 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 129.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=18, InterpolantAutomatonStates: 379, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 513 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 217 PreInvPairs, 243 NumberOfFragments, 3043 HoareAnnotationTreeSize, 217 FomulaSimplifications, 161790 FormulaSimplificationTreeSizeReduction, 57.9s HoareSimplificationTime, 10 FomulaSimplificationsInter, 4169437 FormulaSimplificationTreeSizeReductionInter, 14.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 112.5s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2001 ConstructedInterpolants, 224 QuantifiedInterpolants, 30165 SizeOfPredicates, 265 NumberOfNonLiveVariables, 4644 ConjunctsInSsa, 916 ConjunctsInUnsatCore, 45 InterpolantComputations, 10 PerfectInterpolantSequences, 1041/1330 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 601]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 607]: Loop Invariant [2022-07-13 15:00:37,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,977 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,978 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,979 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,980 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,981 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,982 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,983 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,984 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,985 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,986 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,987 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,988 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,990 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,991 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,992 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,996 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:37,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:37,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,002 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,003 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,004 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,005 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,006 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,007 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,008 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,009 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,010 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,011 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,012 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,016 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,017 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 15:00:38,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-13 15:00:38,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((list == #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4]] && #memory_$Pointer$[n][n + 4] == 0) && tail == #memory_$Pointer$[x][x]) && #memory_$Pointer$[n][n] == list) && (list == #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4]] || (#memory_$Pointer$[list][list + 4] == list + 4 && list == #memory_$Pointer$[list][list + 4]))) && #memory_$Pointer$[x][x + 4] == 0) && n + 1 < list) && \valid[list] == 1) && list == tail) && n == list) && #memory_$Pointer$[n][n + 4] == 0) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4] + 4] == 0) && x + 1 < #memory_$Pointer$[x][x]) && \valid[x] == 1) && list == x) && unknown-#StackHeapBarrier-unknown < list) && !(n == 0)) && ((#memory_$Pointer$[list][list + 4] == list && list == #memory_$Pointer$[list][list + 4]) || #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][#memory_$Pointer$[list][list + 4] + 4] == 0)) && list == #memory_$Pointer$[n][n]) && !(x == 0)) && list == tail) && \valid[n] == 1) && n == 0) && 0 == #memory_$Pointer$[x][x + 4]) && 0 < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[x][x] == list) || (((((((((((((((#memory_$Pointer$[x][x] == 0 && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x]) || ((#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == 0) && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])) && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && 0 < unknown-#StackHeapBarrier-unknown) || ((((#memory_$Pointer$[n][n] == list && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && list == #memory_$Pointer$[n][n]) && 0 < unknown-#StackHeapBarrier-unknown)) && x == 0) && #memory_$Pointer$[x][list + 4] == 0) || ((((((((#memory_$Pointer$[x][x] == 0 && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[x][x]) || ((#memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][x + 4] && #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4] == 0) && #memory_$Pointer$[x][x + 4] == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4])) && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && 0 < unknown-#StackHeapBarrier-unknown) || ((((#memory_$Pointer$[n][n] == list && \valid[x] == 1) && (((((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x))) && !(#memory_$Pointer$[list][list + 4] == x)) || (((#memory_$Pointer$[n][n] == list && (((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && \valid[n] == 1) || ((((((#memory_$Pointer$[n][n + 4] == 0 && list == x) && n + 1 < tail) && #memory_$Pointer$[n][n + 4] == 0) && n == 0) || ((list == x && #memory_$Pointer$[x][x + 4] == 0) && #memory_$Pointer$[list][list] == 0)) && !(#memory_$Pointer$[list][list + 4] == x)))) && !(n == 0)) && list == #memory_$Pointer$[n][n]))) && list == #memory_$Pointer$[n][n]) && 0 < unknown-#StackHeapBarrier-unknown)) && x == 0) && !(n == 0))) && list == tail) && list == x) && unknown-#StackHeapBarrier-unknown < list) && list == tail) && 0 == #memory_$Pointer$[x][x + 4]) && #memory_$Pointer$[x][x] == list) RESULT: Ultimate proved your program to be correct! [2022-07-13 15:00:38,241 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-13 15:00:38,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE