./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/ldv-regression/ex3_forlist.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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:31:40,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:31:40,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:31:40,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:31:40,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:31:40,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:31:40,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:31:40,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:31:40,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:31:40,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:31:40,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:31:40,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:31:40,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:31:40,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:31:40,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:31:40,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:31:40,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:31:40,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:31:40,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:31:40,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:31:40,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:31:40,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:31:40,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:31:40,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:31:40,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:31:40,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:31:40,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:31:40,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:31:40,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:31:40,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:31:40,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:31:40,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:31:40,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:31:40,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:31:40,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:31:40,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:31:40,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:31:40,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:31:40,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:31:40,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:31:40,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:31:40,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:31:40,303 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:31:40,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:31:40,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:31:40,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:31:40,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:31:40,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:31:40,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:31:40,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:31:40,312 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:31:40,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:31:40,313 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:31:40,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:31:40,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:31:40,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:31:40,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:31:40,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:31:40,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:31:40,314 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:31:40,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:31:40,315 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:31:40,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:31:40,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:31:40,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:31:40,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:31:40,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:31:40,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:31:40,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:31:40,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:31:40,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:31:40,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:31:40,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:31:40,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:31:40,318 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:31:40,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:31:40,318 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:31:40,318 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2023-02-15 19:31:40,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:31:40,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:31:40,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:31:40,599 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:31:40,599 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:31:40,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-02-15 19:31:41,672 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:31:41,866 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:31:41,866 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-02-15 19:31:41,872 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1e89f59/2957ccb8e53f4da8975baabcc0b6f685/FLAG79c42cd85 [2023-02-15 19:31:41,892 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1e89f59/2957ccb8e53f4da8975baabcc0b6f685 [2023-02-15 19:31:41,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:31:41,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:31:41,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:31:41,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:31:41,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:31:41,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:31:41" (1/1) ... [2023-02-15 19:31:41,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189c0613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:41, skipping insertion in model container [2023-02-15 19:31:41,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:31:41" (1/1) ... [2023-02-15 19:31:41,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:31:41,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:31:42,022 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-02-15 19:31:42,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:31:42,050 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:31:42,057 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-02-15 19:31:42,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:31:42,076 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:31:42,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42 WrapperNode [2023-02-15 19:31:42,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:31:42,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:31:42,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:31:42,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:31:42,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,102 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2023-02-15 19:31:42,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:31:42,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:31:42,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:31:42,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:31:42,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:31:42,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:31:42,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:31:42,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:31:42,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (1/1) ... [2023-02-15 19:31:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:31:42,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:42,161 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) [2023-02-15 19:31:42,163 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 [2023-02-15 19:31:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:31:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:31:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:31:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-02-15 19:31:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-02-15 19:31:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure g [2023-02-15 19:31:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2023-02-15 19:31:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:31:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2023-02-15 19:31:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2023-02-15 19:31:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:31:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:31:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:31:42,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:31:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:31:42,279 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:31:42,281 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:31:42,542 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:31:42,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:31:42,548 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 19:31:42,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:31:42 BoogieIcfgContainer [2023-02-15 19:31:42,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:31:42,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:31:42,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:31:42,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:31:42,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:31:41" (1/3) ... [2023-02-15 19:31:42,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c9ab45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:31:42, skipping insertion in model container [2023-02-15 19:31:42,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:42" (2/3) ... [2023-02-15 19:31:42,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c9ab45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:31:42, skipping insertion in model container [2023-02-15 19:31:42,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:31:42" (3/3) ... [2023-02-15 19:31:42,557 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2023-02-15 19:31:42,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:31:42,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:31:42,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:31:42,646 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2055cd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:31:42,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:31:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:31:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 19:31:42,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:42,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:42,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1517633021, now seen corresponding path program 1 times [2023-02-15 19:31:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:42,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743166248] [2023-02-15 19:31:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 19:31:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 19:31:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 19:31:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:42,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:31:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 19:31:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:42,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743166248] [2023-02-15 19:31:42,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743166248] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:42,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:42,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:31:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48651123] [2023-02-15 19:31:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:42,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:31:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:31:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:31:42,934 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:31:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:43,061 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2023-02-15 19:31:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:31:43,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-02-15 19:31:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:43,070 INFO L225 Difference]: With dead ends: 82 [2023-02-15 19:31:43,070 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 19:31:43,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:31:43,076 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:43,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:31:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 19:31:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2023-02-15 19:31:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:31:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-02-15 19:31:43,105 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2023-02-15 19:31:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:43,105 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-02-15 19:31:43,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:31:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-02-15 19:31:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 19:31:43,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:43,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:43,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:31:43,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1707935715, now seen corresponding path program 1 times [2023-02-15 19:31:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:43,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376320777] [2023-02-15 19:31:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 19:31:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 19:31:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 19:31:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:31:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 19:31:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:43,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376320777] [2023-02-15 19:31:43,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376320777] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:43,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:43,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:31:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781417149] [2023-02-15 19:31:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:43,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:31:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:43,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:31:43,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:31:43,243 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:31:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:43,369 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2023-02-15 19:31:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:31:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-02-15 19:31:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:43,377 INFO L225 Difference]: With dead ends: 75 [2023-02-15 19:31:43,377 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 19:31:43,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:31:43,383 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:43,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 41 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:31:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 19:31:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-02-15 19:31:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:31:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-02-15 19:31:43,398 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2023-02-15 19:31:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:43,398 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-02-15 19:31:43,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:31:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-02-15 19:31:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 19:31:43,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:43,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:43,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:31:43,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1895345243, now seen corresponding path program 1 times [2023-02-15 19:31:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:43,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743346514] [2023-02-15 19:31:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:31:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 19:31:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:31:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 19:31:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:31:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:43,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743346514] [2023-02-15 19:31:43,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743346514] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:43,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108753541] [2023-02-15 19:31:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:43,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:43,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:43,557 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) [2023-02-15 19:31:43,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:31:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:43,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 19:31:43,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:31:43,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:31:43,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108753541] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:43,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:31:43,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-02-15 19:31:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215166242] [2023-02-15 19:31:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:43,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:31:43,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:31:43,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:31:43,694 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 19:31:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:43,730 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2023-02-15 19:31:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:31:43,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-02-15 19:31:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:43,732 INFO L225 Difference]: With dead ends: 58 [2023-02-15 19:31:43,732 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 19:31:43,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:31:43,733 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:43,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:31:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 19:31:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 19:31:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:31:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-02-15 19:31:43,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2023-02-15 19:31:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:43,740 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-02-15 19:31:43,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 19:31:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-02-15 19:31:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:31:43,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:43,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:43,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:43,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:43,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1248982919, now seen corresponding path program 1 times [2023-02-15 19:31:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:43,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738938732] [2023-02-15 19:31:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 19:31:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 19:31:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:31:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:31:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:44,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738938732] [2023-02-15 19:31:44,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738938732] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:44,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921190468] [2023-02-15 19:31:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:44,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:44,101 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) [2023-02-15 19:31:44,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:31:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:44,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:31:44,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:44,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:44,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921190468] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:44,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:44,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-02-15 19:31:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825109560] [2023-02-15 19:31:44,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:31:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:31:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:31:44,320 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-02-15 19:31:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:44,435 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2023-02-15 19:31:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:31:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 35 [2023-02-15 19:31:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:44,437 INFO L225 Difference]: With dead ends: 78 [2023-02-15 19:31:44,437 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 19:31:44,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:31:44,440 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:44,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:31:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 19:31:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2023-02-15 19:31:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:31:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-15 19:31:44,458 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2023-02-15 19:31:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:44,459 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-15 19:31:44,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-02-15 19:31:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-15 19:31:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:31:44,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:44,460 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 19:31:44,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:44,666 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,SelfDestructingSolverStorable3 [2023-02-15 19:31:44,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1916572233, now seen corresponding path program 2 times [2023-02-15 19:31:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124808561] [2023-02-15 19:31:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:31:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124808561] [2023-02-15 19:31:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124808561] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:45,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:45,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:31:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711028580] [2023-02-15 19:31:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:45,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:31:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:31:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:31:45,126 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:31:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:45,470 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2023-02-15 19:31:45,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:31:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-15 19:31:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:45,473 INFO L225 Difference]: With dead ends: 90 [2023-02-15 19:31:45,473 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 19:31:45,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-02-15 19:31:45,474 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:45,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 78 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:31:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 19:31:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2023-02-15 19:31:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 states have internal predecessors, (64), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-15 19:31:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2023-02-15 19:31:45,485 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 37 [2023-02-15 19:31:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:45,486 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2023-02-15 19:31:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:31:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2023-02-15 19:31:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:31:45,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:45,487 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-02-15 19:31:45,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:31:45,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1102539601, now seen corresponding path program 1 times [2023-02-15 19:31:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641545231] [2023-02-15 19:31:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:31:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:46,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:46,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641545231] [2023-02-15 19:31:46,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641545231] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:46,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082523086] [2023-02-15 19:31:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:46,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:46,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:46,142 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) [2023-02-15 19:31:46,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:31:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:46,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 19:31:46,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:46,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-15 19:31:46,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:46,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:31:46,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:31:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:31:46,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:46,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:46,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-02-15 19:31:46,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-15 19:31:46,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 19:31:47,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:47,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 19:31:47,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:31:47,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:47,066 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 19 [2023-02-15 19:31:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:31:47,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082523086] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:47,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:47,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2023-02-15 19:31:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630819286] [2023-02-15 19:31:47,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:47,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 19:31:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 19:31:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 19:31:47,321 INFO L87 Difference]: Start difference. First operand 67 states and 88 transitions. Second operand has 38 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 19:31:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:48,376 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2023-02-15 19:31:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:31:48,377 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 40 [2023-02-15 19:31:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:48,378 INFO L225 Difference]: With dead ends: 136 [2023-02-15 19:31:48,378 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 19:31:48,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 19:31:48,380 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:48,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 101 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:31:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 19:31:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2023-02-15 19:31:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2023-02-15 19:31:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2023-02-15 19:31:48,399 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 40 [2023-02-15 19:31:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:48,400 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2023-02-15 19:31:48,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 19:31:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2023-02-15 19:31:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:31:48,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:48,403 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-15 19:31:48,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:48,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:48,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2084265885, now seen corresponding path program 1 times [2023-02-15 19:31:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:48,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768791877] [2023-02-15 19:31:48,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:48,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:31:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:31:49,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:49,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768791877] [2023-02-15 19:31:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768791877] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254626134] [2023-02-15 19:31:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:49,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:49,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:49,065 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) [2023-02-15 19:31:49,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:31:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:49,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 19:31:49,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:49,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:31:49,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:31:49,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:49,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:49,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-02-15 19:31:49,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:49,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2023-02-15 19:31:49,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:31:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 19:31:49,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:49,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254626134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:49,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:31:49,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2023-02-15 19:31:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386069626] [2023-02-15 19:31:49,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:49,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 19:31:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 19:31:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=484, Unknown=7, NotChecked=0, Total=600 [2023-02-15 19:31:49,771 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 19:31:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:50,713 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2023-02-15 19:31:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 19:31:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2023-02-15 19:31:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:50,714 INFO L225 Difference]: With dead ends: 141 [2023-02-15 19:31:50,715 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 19:31:50,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1239, Unknown=37, NotChecked=0, Total=1640 [2023-02-15 19:31:50,716 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 215 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 47 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:50,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 107 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 482 Invalid, 46 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:31:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 19:31:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2023-02-15 19:31:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-02-15 19:31:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-02-15 19:31:50,728 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 40 [2023-02-15 19:31:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:50,729 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-02-15 19:31:50,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 19:31:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-02-15 19:31:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 19:31:50,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:50,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2023-02-15 19:31:50,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 19:31:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:50,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -658709463, now seen corresponding path program 1 times [2023-02-15 19:31:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577171092] [2023-02-15 19:31:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:50,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 19:31:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:31:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:51,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577171092] [2023-02-15 19:31:51,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577171092] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:51,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308600306] [2023-02-15 19:31:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:51,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:51,021 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) [2023-02-15 19:31:51,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:31:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:31:51,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:31:51,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:31:51,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308600306] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:51,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:51,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-15 19:31:51,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884139442] [2023-02-15 19:31:51,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:51,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:31:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:31:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:31:51,169 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 19:31:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:51,305 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2023-02-15 19:31:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:31:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-02-15 19:31:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:51,309 INFO L225 Difference]: With dead ends: 169 [2023-02-15 19:31:51,309 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 19:31:51,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:31:51,314 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:51,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:31:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 19:31:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2023-02-15 19:31:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 77 states have internal predecessors, (94), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-02-15 19:31:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2023-02-15 19:31:51,333 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 41 [2023-02-15 19:31:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:51,334 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2023-02-15 19:31:51,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 19:31:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2023-02-15 19:31:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 19:31:51,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:51,336 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2023-02-15 19:31:51,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:51,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:51,543 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash 387918117, now seen corresponding path program 1 times [2023-02-15 19:31:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:51,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366222380] [2023-02-15 19:31:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:31:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366222380] [2023-02-15 19:31:52,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366222380] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740004179] [2023-02-15 19:31:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:52,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:52,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:52,009 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) [2023-02-15 19:31:52,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 19:31:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:52,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:31:52,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:52,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:31:52,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:31:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:52,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:52,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 19:31:52,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-15 19:31:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:31:52,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740004179] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:52,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:52,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 24 [2023-02-15 19:31:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472400095] [2023-02-15 19:31:52,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:52,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 19:31:52,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:52,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 19:31:52,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-15 19:31:52,489 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 21 states have internal predecessors, (82), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 6 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-15 19:31:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:53,500 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2023-02-15 19:31:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 19:31:53,500 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 21 states have internal predecessors, (82), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 6 states have call predecessors, (12), 3 states have call successors, (12) Word has length 43 [2023-02-15 19:31:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:53,503 INFO L225 Difference]: With dead ends: 184 [2023-02-15 19:31:53,504 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 19:31:53,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=458, Invalid=1992, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 19:31:53,507 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 197 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:53,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 147 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:31:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 19:31:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2023-02-15 19:31:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 118 states have internal predecessors, (144), 17 states have call successors, (17), 11 states have call predecessors, (17), 17 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25) [2023-02-15 19:31:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 186 transitions. [2023-02-15 19:31:53,531 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 186 transitions. Word has length 43 [2023-02-15 19:31:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:53,531 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 186 transitions. [2023-02-15 19:31:53,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 21 states have internal predecessors, (82), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 6 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-15 19:31:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2023-02-15 19:31:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 19:31:53,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:53,533 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 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] [2023-02-15 19:31:53,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:53,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:53,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -479191559, now seen corresponding path program 2 times [2023-02-15 19:31:53,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:53,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292535284] [2023-02-15 19:31:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:53,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 19:31:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 19:31:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:55,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292535284] [2023-02-15 19:31:55,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292535284] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:55,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771199755] [2023-02-15 19:31:55,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:31:55,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:55,193 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) [2023-02-15 19:31:55,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:31:55,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:31:55,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:31:55,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 19:31:55,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:55,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-02-15 19:31:55,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:55,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 19:31:55,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-02-15 19:31:55,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:55,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 19:31:55,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:55,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 19:31:55,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:55,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 19:31:55,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:55,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:31:55,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:55,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:31:55,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:31:55,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:31:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:31:55,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:56,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:56,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-02-15 19:31:56,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2023-02-15 19:31:56,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:56,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 19:31:56,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2023-02-15 19:31:56,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 19:31:56,525 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:31:56,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2023-02-15 19:31:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:31:56,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771199755] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:56,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:56,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 11] total 48 [2023-02-15 19:31:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619976595] [2023-02-15 19:31:56,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:56,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 19:31:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:56,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 19:31:56,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2038, Unknown=20, NotChecked=0, Total=2256 [2023-02-15 19:31:56,588 INFO L87 Difference]: Start difference. First operand 146 states and 186 transitions. Second operand has 48 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 39 states have internal predecessors, (87), 8 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 19:31:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:58,175 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2023-02-15 19:31:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:31:58,181 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 39 states have internal predecessors, (87), 8 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 43 [2023-02-15 19:31:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:58,182 INFO L225 Difference]: With dead ends: 208 [2023-02-15 19:31:58,182 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 19:31:58,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=556, Invalid=3980, Unknown=20, NotChecked=0, Total=4556 [2023-02-15 19:31:58,185 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 183 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:58,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 57 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:31:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 19:31:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2023-02-15 19:31:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 85 states have internal predecessors, (105), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 19:31:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2023-02-15 19:31:58,198 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 43 [2023-02-15 19:31:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:58,198 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2023-02-15 19:31:58,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 39 states have internal predecessors, (87), 8 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 19:31:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2023-02-15 19:31:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 19:31:58,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:58,200 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1] [2023-02-15 19:31:58,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:58,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:58,409 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1603970476, now seen corresponding path program 1 times [2023-02-15 19:31:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:58,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004099652] [2023-02-15 19:31:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:31:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:31:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:31:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:31:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:31:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:59,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004099652] [2023-02-15 19:31:59,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004099652] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:59,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544199078] [2023-02-15 19:31:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:59,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:59,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:59,241 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) [2023-02-15 19:31:59,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 19:31:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:59,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 19:31:59,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:59,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-02-15 19:31:59,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:59,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:31:59,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 19:31:59,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:59,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 19:31:59,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:59,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:31:59,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 19:32:00,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:32:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:32:00,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:00,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1120 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset| v_ArrVal_1121)) |c_~#pstate~0.base| v_ArrVal_1120) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4))))) is different from false [2023-02-15 19:32:00,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544199078] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:00,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:32:00,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2023-02-15 19:32:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396306435] [2023-02-15 19:32:00,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:32:00,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 19:32:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 19:32:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1998, Unknown=12, NotChecked=90, Total=2256 [2023-02-15 19:32:00,471 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 31 states have internal predecessors, (70), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 19:32:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:02,887 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2023-02-15 19:32:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 19:32:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 31 states have internal predecessors, (70), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2023-02-15 19:32:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:02,888 INFO L225 Difference]: With dead ends: 216 [2023-02-15 19:32:02,889 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 19:32:02,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=737, Invalid=5701, Unknown=46, NotChecked=158, Total=6642 [2023-02-15 19:32:02,891 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 372 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 101 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:02,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 122 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1604 Invalid, 46 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 19:32:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 19:32:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-02-15 19:32:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 93 states have internal predecessors, (112), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-15 19:32:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2023-02-15 19:32:02,903 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 45 [2023-02-15 19:32:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:02,904 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2023-02-15 19:32:02,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 31 states have internal predecessors, (70), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 19:32:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2023-02-15 19:32:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 19:32:02,905 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:02,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1] [2023-02-15 19:32:02,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 19:32:03,112 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,SelfDestructingSolverStorable10 [2023-02-15 19:32:03,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1534398088, now seen corresponding path program 1 times [2023-02-15 19:32:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:03,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737371397] [2023-02-15 19:32:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:32:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:32:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:32:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:32:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:32:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:03,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737371397] [2023-02-15 19:32:03,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737371397] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:03,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079281562] [2023-02-15 19:32:03,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:03,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:03,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:03,239 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) [2023-02-15 19:32:03,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 19:32:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:03,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:32:03,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 19:32:03,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:32:03,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079281562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:32:03,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:32:03,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-02-15 19:32:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002526037] [2023-02-15 19:32:03,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:32:03,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:32:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:03,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:32:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:32:03,425 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:32:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:03,450 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2023-02-15 19:32:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:32:03,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2023-02-15 19:32:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:03,451 INFO L225 Difference]: With dead ends: 197 [2023-02-15 19:32:03,451 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 19:32:03,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:32:03,452 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:03,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 105 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:32:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 19:32:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-02-15 19:32:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 95 states have internal predecessors, (109), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 19:32:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-02-15 19:32:03,464 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 48 [2023-02-15 19:32:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:03,465 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-02-15 19:32:03,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 19:32:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-02-15 19:32:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:32:03,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:03,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1] [2023-02-15 19:32:03,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:32:03,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:03,672 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1225479932, now seen corresponding path program 1 times [2023-02-15 19:32:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:03,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170020431] [2023-02-15 19:32:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:32:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:32:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:32:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:32:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 19:32:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:32:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:04,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170020431] [2023-02-15 19:32:04,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170020431] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:04,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751777921] [2023-02-15 19:32:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:04,269 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) [2023-02-15 19:32:04,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 19:32:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:04,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 19:32:04,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:04,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-02-15 19:32:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:32:04,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:32:04,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 19:32:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 19:32:05,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:05,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:05,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 19:32:05,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-02-15 19:32:05,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 19:32:05,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:05,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-15 19:32:05,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:32:05,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:05,386 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 22 treesize of output 18 [2023-02-15 19:32:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:32:05,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751777921] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:32:05,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:32:05,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 52 [2023-02-15 19:32:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803720572] [2023-02-15 19:32:05,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:32:05,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 19:32:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:05,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 19:32:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2467, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 19:32:05,736 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 38 states have internal predecessors, (109), 12 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2023-02-15 19:32:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:08,071 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2023-02-15 19:32:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 19:32:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 38 states have internal predecessors, (109), 12 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) Word has length 53 [2023-02-15 19:32:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:08,073 INFO L225 Difference]: With dead ends: 144 [2023-02-15 19:32:08,073 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 19:32:08,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=899, Invalid=6933, Unknown=0, NotChecked=0, Total=7832 [2023-02-15 19:32:08,075 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 393 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:08,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 140 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 19:32:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 19:32:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-15 19:32:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 19:32:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-02-15 19:32:08,102 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 53 [2023-02-15 19:32:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-02-15 19:32:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 38 states have internal predecessors, (109), 12 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2023-02-15 19:32:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-02-15 19:32:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:32:08,103 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:08,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 1, 1, 1] [2023-02-15 19:32:08,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-15 19:32:08,313 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,SelfDestructingSolverStorable12 [2023-02-15 19:32:08,313 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2101637850, now seen corresponding path program 2 times [2023-02-15 19:32:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:08,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908243569] [2023-02-15 19:32:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:08,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:32:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:32:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:09,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:32:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:32:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 19:32:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:32:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:09,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908243569] [2023-02-15 19:32:09,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908243569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:09,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657107823] [2023-02-15 19:32:09,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:32:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:09,333 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) [2023-02-15 19:32:09,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 19:32:09,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:32:09,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:32:09,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 19:32:09,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:09,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:32:09,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:32:10,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 19:32:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 19:32:10,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:10,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-15 19:32:10,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 19:32:10,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:10,406 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 19:32:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 19:32:10,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657107823] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:32:10,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:32:10,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 52 [2023-02-15 19:32:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200649341] [2023-02-15 19:32:10,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:32:10,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 19:32:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:10,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 19:32:10,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2469, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 19:32:10,746 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 52 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 36 states have internal predecessors, (101), 12 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-15 19:32:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:12,023 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2023-02-15 19:32:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 19:32:12,024 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 36 states have internal predecessors, (101), 12 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 53 [2023-02-15 19:32:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:12,025 INFO L225 Difference]: With dead ends: 98 [2023-02-15 19:32:12,025 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 19:32:12,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=477, Invalid=4493, Unknown=0, NotChecked=0, Total=4970 [2023-02-15 19:32:12,027 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 160 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:12,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 122 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:32:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 19:32:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2023-02-15 19:32:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:32:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2023-02-15 19:32:12,036 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2023-02-15 19:32:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:12,036 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2023-02-15 19:32:12,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 36 states have internal predecessors, (101), 12 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-15 19:32:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2023-02-15 19:32:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 19:32:12,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:12,037 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 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, 1, 1, 1] [2023-02-15 19:32:12,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 19:32:12,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 19:32:12,243 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -699436896, now seen corresponding path program 1 times [2023-02-15 19:32:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:12,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142516208] [2023-02-15 19:32:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 19:32:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:32:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:12,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:32:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:32:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 19:32:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:32:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:13,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142516208] [2023-02-15 19:32:13,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142516208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:13,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659137784] [2023-02-15 19:32:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:13,093 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) [2023-02-15 19:32:13,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 19:32:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:13,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 19:32:13,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:13,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-02-15 19:32:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:32:13,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:32:13,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 19:32:13,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:32:13,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 19:32:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:32:13,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:32:13,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 19:32:13,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 19:32:14,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:32:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:32:14,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:14,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1785 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset| v_ArrVal_1785)) |c_~#pstate~0.base| v_ArrVal_1786) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2023-02-15 19:32:14,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659137784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:14,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:32:14,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-02-15 19:32:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778806708] [2023-02-15 19:32:14,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:32:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 19:32:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 19:32:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2017, Unknown=13, NotChecked=90, Total=2256 [2023-02-15 19:32:14,380 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 41 states, 40 states have (on average 2.1) internal successors, (84), 33 states have internal predecessors, (84), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 19:32:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:15,577 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2023-02-15 19:32:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:32:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 33 states have internal predecessors, (84), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 56 [2023-02-15 19:32:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:15,581 INFO L225 Difference]: With dead ends: 59 [2023-02-15 19:32:15,581 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 19:32:15,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=321, Invalid=3688, Unknown=27, NotChecked=124, Total=4160 [2023-02-15 19:32:15,583 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 45 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:15,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 59 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 631 Invalid, 15 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:32:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 19:32:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 19:32:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:32:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 19:32:15,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2023-02-15 19:32:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:15,585 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 19:32:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 33 states have internal predecessors, (84), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-15 19:32:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 19:32:15,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 19:32:15,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:32:15,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 19:32:15,793 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,SelfDestructingSolverStorable14 [2023-02-15 19:32:15,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 19:32:17,261 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2023-02-15 19:32:17,262 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2023-02-15 19:32:17,262 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse13 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse2 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse4 (= f_~pointer.offset |f_#in~pointer.offset|)) (.cse5 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse6 (= f_~pointer.base |f_#in~pointer.base|)) (.cse14 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse15 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= (select .cse14 .cse15) 0))) (.cse1 (and .cse3 .cse2 .cse4 (= f_~i~1 0) .cse5 .cse6)) (.cse7 (not (= (select .cse13 .cse15) 0))) (.cse9 (not (= |~#pstate~0.offset| 0))) (.cse10 (not (<= 5 |~#pstate~0.base|))) (.cse8 (select .cse14 |~#pp~0.offset|)) (.cse11 (not (= |~#pp~0.offset| 0))) (.cse12 (not (<= |~#pp~0.base| 4)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (= f_~i~1 1) .cse5 .cse6) .cse7 (not (= .cse8 1)) .cse9 .cse10 .cse11 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|) 1)) .cse12) (or (not (= (select .cse13 |~#pp~0.offset|) 0)) .cse0 .cse1 .cse7 .cse9 .cse10 (not (= .cse8 0)) .cse11 .cse12)))) [2023-02-15 19:32:17,262 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2023-02-15 19:32:17,262 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 34) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse9 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse10 (+ |~#pp~0.offset| 4))) (let ((.cse1 (not (= (select .cse9 .cse10) 0))) (.cse2 (not (= (select .cse0 .cse10) 0))) (.cse3 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse6 (select .cse9 |~#pp~0.offset|)) (.cse4 (not (= |~#pstate~0.offset| 0))) (.cse5 (not (<= 5 |~#pstate~0.base|))) (.cse7 (not (= |~#pp~0.offset| 0))) (.cse8 (not (<= |~#pp~0.base| 4)))) (and (or (not (= (select .cse0 |~#pp~0.offset|) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= .cse6 0)) .cse7 .cse8) (or .cse1 .cse2 .cse3 (not (= .cse6 1)) .cse4 .cse5 .cse7 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|) 1)) .cse8)))) [2023-02-15 19:32:17,262 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2023-02-15 19:32:17,262 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 36 45) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= (select .cse5 (+ |~#pp~0.offset| 4)) 1))) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse2 (not (= |~#pstate~0.offset| 0))) (.cse3 (not (<= 5 |~#pstate~0.base|))) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse6 (not (<= |~#pp~0.base| 4)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (select .cse5 |~#pstate~0.offset|) 1)) .cse6) (or .cse0 (not (= (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0) 1)) (not (= |g_#in~pointer#1.offset| 2)) .cse1 .cse2 .cse3 .cse4 .cse6)))) [2023-02-15 19:32:17,262 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2023-02-15 19:32:17,262 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse17 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse11 (select .cse17 |~#pp~0.offset|)) (.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (+ |~#pp~0.offset| 4))) (let ((.cse16 (select .cse17 .cse9)) (.cse31 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse30 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse32 (select .cse5 |~#pp~0.offset|)) (.cse33 (= .cse11 0))) (let ((.cse7 (<= 2 |g_~i~2#1|)) (.cse24 (<= |~#pp~0.base| 4)) (.cse23 (= |~#pp~0.offset| 0)) (.cse22 (or (not (= 0 .cse32)) .cse33)) (.cse26 (let ((.cse34 (select .cse30 0)) (.cse35 (select .cse31 0))) (or (= .cse34 .cse35) (and (= 0 .cse34) (= .cse35 |f_#in~pointer.base|))))) (.cse28 (or (= |~#pstate~0.base| |~#pp~0.base|) (= .cse16 (select .cse5 .cse9)))) (.cse8 (select |#memory_int| |~#pstate~0.base|)) (.cse6 (* |g_~i~2#1| 4)) (.cse29 (or (not (= (select .cse30 |~#pp~0.offset|) 0)) (and (= (select .cse31 |~#pp~0.offset|) 0) (= .cse32 0)) (not .cse33))) (.cse25 (<= 5 |~#pstate~0.base|)) (.cse27 (= |~#pstate~0.offset| 0)) (.cse10 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse1 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|)) (.cse0 (not (= (select .cse10 .cse9) 1))) (.cse18 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |g_~i~2#1| 0)) (.cse19 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse12 (not .cse27)) (.cse13 (not .cse25)) (.cse20 (and .cse22 (<= .cse9 (+ |~#pstate~0.offset| (* 4 |g_~i~2#1|))) .cse25 .cse26 .cse27 .cse28 (= (select .cse8 (+ |~#pstate~0.offset| .cse6)) 1) .cse29)) (.cse14 (not .cse23)) (.cse15 (not .cse24)) (.cse21 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse7 .cse27 .cse28 .cse29))) (and (let ((.cse3 (= .cse17 .cse5)) (.cse4 (= .cse16 |g_#in~pointer#1.offset|))) (or .cse0 (and .cse1 .cse2) (and .cse3 (or .cse4 (not (= (select .cse5 (+ .cse6 |~#pp~0.offset|)) |g_~pointer#1.offset|))) (= |g_~i~2#1| 1)) (and .cse3 .cse7 (= (select .cse8 .cse9) 1)) (not (= (select .cse10 0) 1)) (not (= |g_#in~pointer#1.offset| .cse11)) .cse12 .cse13 (and .cse4 .cse7) .cse14 .cse15)) (or .cse0 (and .cse18 (= |old(#memory_int)| |#memory_int|) .cse1 .cse2 .cse19) (not (= (select .cse17 0) 1)) (not (= |g_#in~pointer#1.offset| 2)) .cse12 .cse13 .cse20 .cse14 .cse15 .cse21) (or .cse0 (and (= |#memory_int| |old(#memory_int)|) .cse18 .cse2 .cse19) .cse12 .cse13 .cse20 .cse14 (not (= (select .cse10 |~#pstate~0.offset|) 1)) .cse15 .cse21))))))) [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 9) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#pstate~0.base|)) (.cse7 (+ |~#pp~0.offset| 4))) (let ((.cse0 (= |~#pp~0.offset| 0)) (.cse2 (<= |~#pp~0.base| 4)) (.cse3 (<= 5 |~#pstate~0.base|)) (.cse4 (= |~#pstate~0.offset| 0)) (.cse5 (= (select .cse1 .cse7) 1))) (or (and .cse0 (= (select .cse1 |~#pstate~0.offset|) 1) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (let ((.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) .cse0 (<= 2 ~counter~0) .cse2 .cse3 (not (= (select .cse6 .cse7) |ULTIMATE.start_main_~a~0#1.offset|)) .cse4 .cse5 (= (select .cse6 0) 1) (= (+ (select .cse6 |~#pp~0.offset|) 1) |ULTIMATE.start_main_~b~0#1.offset|)))))) [2023-02-15 19:32:17,263 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (+ |~#pp~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 |~#pp~0.offset|) 0) (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= 5 |~#pstate~0.base|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select .cse0 .cse2) 0) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= |ULTIMATE.start_main_~b~0#1.base| 0) (<= |~#pp~0.base| 4) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0))) [2023-02-15 19:32:17,263 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (< 0 |ULTIMATE.start_init_~i~0#1|) (<= 5 |~#pstate~0.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1) 0) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (<= |~#pp~0.base| 4) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse0 0) 1) (= (+ (select .cse0 |~#pp~0.offset|) 1) |ULTIMATE.start_main_~b~0#1.offset|))) [2023-02-15 19:32:17,263 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (+ |~#pp~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 |~#pp~0.offset|) 0) (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= 5 |~#pstate~0.base|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= ~counter~0 2) (= (select .cse0 .cse2) 0) (= |~#pp~0.offset| 0) (<= |~#pp~0.base| 4) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0))) [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-02-15 19:32:17,263 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2023-02-15 19:32:17,264 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-02-15 19:32:17,264 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse10 (+ |~#pp~0.offset| 4))) (let ((.cse0 (= (select .cse1 .cse10) 0)) (.cse2 (= |~#pp~0.offset| 0)) (.cse3 (= ~counter~0 1)) (.cse4 (<= |~#pp~0.base| 4)) (.cse5 (<= 5 |~#pstate~0.base|)) (.cse6 (= |~#pstate~0.offset| 0)) (.cse8 (= (select .cse7 .cse10) 0))) (or (and .cse0 (= (select .cse1 |~#pp~0.offset|) 0) .cse2 .cse3 (<= 1 |ULTIMATE.start_init_~i~0#1|) .cse4 .cse5 .cse6 (= (select .cse7 |~#pp~0.offset|) 0) .cse8) (let ((.cse9 (+ |~#pp~0.offset| (* |ULTIMATE.start_init_~i~0#1| 4)))) (and .cse0 (= |ULTIMATE.start_init_~i~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse1 .cse9) 0) .cse8 (= (select .cse7 .cse9) 0)))))) [2023-02-15 19:32:17,264 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 19:32:17,264 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 53 71) the Hoare annotation is: true [2023-02-15 19:32:17,264 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 19:32:17,264 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#pstate~0.base|)) (.cse2 (+ |~#pp~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= (select .cse0 |~#pstate~0.offset|) 1) (= (select .cse1 .cse2) 2) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pstate~0.offset| 0) (= (select .cse0 .cse2) 1) (= (select .cse1 0) 1) (= (+ (select .cse1 |~#pp~0.offset|) 1) |ULTIMATE.start_main_~b~0#1.offset|))) [2023-02-15 19:32:17,264 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 19:32:17,264 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2023-02-15 19:32:17,264 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (= ~counter~0 1) (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse2 |~#pp~0.offset|) 0) (= (select .cse2 .cse1) 0))) [2023-02-15 19:32:17,264 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-02-15 19:32:17,265 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-02-15 19:32:17,265 INFO L899 garLoopResultBuilder]: For program point fake_mallocFINAL(lines 48 51) no Hoare annotation was computed. [2023-02-15 19:32:17,265 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 48 51) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= (select .cse10 .cse9) 0))) (.cse1 (not (= (select .cse10 |~#pp~0.offset|) 0))) (.cse2 (not (= |~#pstate~0.offset| 0))) (.cse3 (not (<= 5 |~#pstate~0.base|))) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse5 (not (= (select .cse8 .cse9) 0))) (.cse6 (not (= (select .cse8 |~#pp~0.offset|) 0))) (.cse7 (not (<= |~#pp~0.base| 4)))) (and (or (not (= |old(~counter~0)| 1)) .cse0 (= ~counter~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (= ~counter~0 2) (not (= |old(~counter~0)| 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2023-02-15 19:32:17,265 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2023-02-15 19:32:17,268 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:32:17,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:32:17,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,288 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 07:32:17 BoogieIcfgContainer [2023-02-15 19:32:17,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 19:32:17,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 19:32:17,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 19:32:17,330 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 19:32:17,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:31:42" (3/4) ... [2023-02-15 19:32:17,333 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 19:32:17,338 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2023-02-15 19:32:17,339 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2023-02-15 19:32:17,339 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2023-02-15 19:32:17,342 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-15 19:32:17,342 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-15 19:32:17,342 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 19:32:17,343 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 19:32:17,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(\old(#memory_$Pointer$)[pp][pp + 4] == 0) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer)) || (((((\old(#memory_$Pointer$) == #memory_$Pointer$ && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && pointer == pointer) && i == 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 1)) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) && ((((((((!(\old(#memory_$Pointer$)[pp][pp] == 0) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(pstate == 0)) || !(5 <= pstate)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)) || !(pp == 0)) || !(pp <= 4)) [2023-02-15 19:32:17,363 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || (pointer == pointer && i == 0)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && (\old(#memory_$Pointer$)[pp][pp + 4] == pointer || !(#memory_$Pointer$[pp][i * 4 + pp] == pointer))) && i == 1)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && 2 <= i) && unknown-#memory_int-unknown[pstate][pp + 4] == 1)) || !(\old(unknown-#memory_int-unknown)[pstate][0] == 1)) || !(pointer == \old(#memory_$Pointer$)[pp][pp])) || !(pstate == 0)) || !(5 <= pstate)) || (\old(#memory_$Pointer$)[pp][pp + 4] == pointer && 2 <= i)) || !(pp == 0)) || !(pp <= 4)) && (((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || ((((#memory_$Pointer$ == \old(#memory_$Pointer$) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(#memory_$Pointer$)[pp][0] == 1)) || !(pointer == 2)) || !(pstate == 0)) || !(5 <= pstate)) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp + 4 <= pstate + 4 * i) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pp == 0)) || !(pp <= 4)) || (((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && pp <= 4) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && 2 <= i) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))))) && ((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(pstate == 0)) || !(5 <= pstate)) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp + 4 <= pstate + 4 * i) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) || (((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && pp <= 4) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && 2 <= i) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) [2023-02-15 19:32:17,372 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 19:32:17,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 19:32:17,372 INFO L158 Benchmark]: Toolchain (without parser) took 35477.99ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 74.8MB in the beginning and 237.3MB in the end (delta: -162.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2023-02-15 19:32:17,373 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:32:17,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.42ms. Allocated memory is still 119.5MB. Free memory was 74.5MB in the beginning and 64.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 19:32:17,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.30ms. Allocated memory is still 119.5MB. Free memory was 64.2MB in the beginning and 62.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:32:17,373 INFO L158 Benchmark]: Boogie Preprocessor took 22.03ms. Allocated memory is still 119.5MB. Free memory was 62.5MB in the beginning and 61.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:32:17,374 INFO L158 Benchmark]: RCFGBuilder took 423.96ms. Allocated memory is still 119.5MB. Free memory was 61.1MB in the beginning and 47.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 19:32:17,374 INFO L158 Benchmark]: TraceAbstraction took 34777.96ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 46.9MB in the beginning and 240.4MB in the end (delta: -193.5MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. [2023-02-15 19:32:17,374 INFO L158 Benchmark]: Witness Printer took 42.08ms. Allocated memory is still 302.0MB. Free memory was 240.4MB in the beginning and 237.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 19:32:17,375 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.16ms. Allocated memory is still 119.5MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.42ms. Allocated memory is still 119.5MB. Free memory was 74.5MB in the beginning and 64.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.30ms. Allocated memory is still 119.5MB. Free memory was 64.2MB in the beginning and 62.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.03ms. Allocated memory is still 119.5MB. Free memory was 62.5MB in the beginning and 61.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 423.96ms. Allocated memory is still 119.5MB. Free memory was 61.1MB in the beginning and 47.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34777.96ms. Allocated memory was 119.5MB in the beginning and 302.0MB in the end (delta: 182.5MB). Free memory was 46.9MB in the beginning and 240.4MB in the end (delta: -193.5MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. * Witness Printer took 42.08ms. Allocated memory is still 302.0MB. Free memory was 240.4MB in the beginning and 237.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * 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: 8]: 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 4 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 107 mSolverCounterUnknown, 2280 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2253 mSDsluCounter, 1310 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1010 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8945 IncrementalHoareTripleChecker+Invalid, 9639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 300 mSDtfsCounter, 8945 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 825 SyntacticMatches, 13 SemanticMatches, 557 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7193 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=9, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 178 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 136 PreInvPairs, 174 NumberOfFragments, 1717 HoareAnnotationTreeSize, 136 FomulaSimplifications, 5772 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 4290 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1433 ConstructedInterpolants, 8 QuantifiedInterpolants, 11339 SizeOfPredicates, 79 NumberOfNonLiveVariables, 3732 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 391/660 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: 38]: Loop Invariant [2023-02-15 19:32:17,401 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,401 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,402 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,417 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,418 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || (pointer == pointer && i == 0)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && (\old(#memory_$Pointer$)[pp][pp + 4] == pointer || !(#memory_$Pointer$[pp][i * 4 + pp] == pointer))) && i == 1)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && 2 <= i) && unknown-#memory_int-unknown[pstate][pp + 4] == 1)) || !(\old(unknown-#memory_int-unknown)[pstate][0] == 1)) || !(pointer == \old(#memory_$Pointer$)[pp][pp])) || !(pstate == 0)) || !(5 <= pstate)) || (\old(#memory_$Pointer$)[pp][pp + 4] == pointer && 2 <= i)) || !(pp == 0)) || !(pp <= 4)) && (((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || ((((#memory_$Pointer$ == \old(#memory_$Pointer$) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(#memory_$Pointer$)[pp][0] == 1)) || !(pointer == 2)) || !(pstate == 0)) || !(5 <= pstate)) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp + 4 <= pstate + 4 * i) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pp == 0)) || !(pp <= 4)) || (((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && pp <= 4) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && 2 <= i) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))))) && ((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(pstate == 0)) || !(5 <= pstate)) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp + 4 <= pstate + 4 * i) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) || (((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && pp <= 4) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && 2 <= i) && pstate == 0) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant [2023-02-15 19:32:17,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((!(\old(#memory_$Pointer$)[pp][pp + 4] == 0) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer)) || (((((\old(#memory_$Pointer$) == #memory_$Pointer$ && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && pointer == pointer) && i == 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 1)) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) && ((((((((!(\old(#memory_$Pointer$)[pp][pp] == 0) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(pstate == 0)) || !(5 <= pstate)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)) || !(pp == 0)) || !(pp <= 4)) - InvariantResult [Line: 19]: Loop Invariant [2023-02-15 19:32:17,432 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,432 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,432 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-15 19:32:17,434 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((#memory_$Pointer$[pp][pp + 4] == 0 && #memory_$Pointer$[pp][pp] == 0) && pp == 0) && counter == 1) && 1 <= i) && pp <= 4) && 5 <= pstate) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) || (((((((((#memory_$Pointer$[pp][pp + 4] == 0 && i == 0) && pp == 0) && counter == 1) && pp <= 4) && 5 <= pstate) && pstate == 0) && #memory_$Pointer$[pp][pp + i * 4] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp + i * 4] == 0) RESULT: Ultimate proved your program to be correct! [2023-02-15 19:32:17,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE