./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 c3fed411 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 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:08:57,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:08:57,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:08:57,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:08:57,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:08:57,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:08:58,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:08:58,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:08:58,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:08:58,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:08:58,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:08:58,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:08:58,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:08:58,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:08:58,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:08:58,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:08:58,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:08:58,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:08:58,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:08:58,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:08:58,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:08:58,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:08:58,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:08:58,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:08:58,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:08:58,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:08:58,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:08:58,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:08:58,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:08:58,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:08:58,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:08:58,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:08:58,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:08:58,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:08:58,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:08:58,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:08:58,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:08:58,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:08:58,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:08:58,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:08:58,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:08:58,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 08:08:58,073 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:08:58,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:08:58,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:08:58,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:08:58,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:08:58,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:08:58,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:08:58,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:08:58,076 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:08:58,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:08:58,077 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:08:58,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:08:58,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:08:58,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:08:58,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:08:58,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:08:58,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:08:58,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:08:58,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:08:58,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:08:58,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:08:58,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:08:58,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:08:58,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:08:58,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:08:58,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:08:58,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:08:58,081 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:08:58,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33fdb29d081e8788960943f1182fbfb10ca7dcdfe7c31b22aaab16bda45fd1b8 [2021-12-17 08:08:58,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:08:58,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:08:58,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:08:58,353 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:08:58,354 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:08:58,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-12-17 08:08:58,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4fac3be/f1f0f0e5790e45bfbcda03ce7c78d426/FLAG7a8975040 [2021-12-17 08:08:58,777 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:08:58,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2021-12-17 08:08:58,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4fac3be/f1f0f0e5790e45bfbcda03ce7c78d426/FLAG7a8975040 [2021-12-17 08:08:58,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d4fac3be/f1f0f0e5790e45bfbcda03ce7c78d426 [2021-12-17 08:08:58,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:08:58,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:08:58,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:08:58,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:08:58,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:08:58,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:08:58" (1/1) ... [2021-12-17 08:08:58,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c54306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:58, skipping insertion in model container [2021-12-17 08:08:58,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:08:58" (1/1) ... [2021-12-17 08:08:58,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:08:58,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:08:58,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-12-17 08:08:58,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:08:58,982 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:08:58,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2021-12-17 08:08:59,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:08:59,025 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:08:59,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59 WrapperNode [2021-12-17 08:08:59,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:08:59,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:08:59,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:08:59,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:08:59,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,061 INFO L137 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2021-12-17 08:08:59,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:08:59,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:08:59,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:08:59,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:08:59,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:08:59,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:08:59,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:08:59,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:08:59,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (1/1) ... [2021-12-17 08:08:59,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:08:59,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:08:59,128 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) [2021-12-17 08:08:59,137 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 [2021-12-17 08:08:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:08:59,160 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-12-17 08:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2021-12-17 08:08:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:08:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:08:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-12-17 08:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-12-17 08:08:59,161 INFO L130 BoogieDeclarations]: Found specification of procedure g [2021-12-17 08:08:59,161 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2021-12-17 08:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 08:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:08:59,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:08:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 08:08:59,250 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:08:59,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:08:59,386 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:08:59,390 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:08:59,391 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 08:08:59,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:08:59 BoogieIcfgContainer [2021-12-17 08:08:59,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:08:59,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:08:59,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:08:59,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:08:59,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:08:58" (1/3) ... [2021-12-17 08:08:59,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6933777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:08:59, skipping insertion in model container [2021-12-17 08:08:59,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:08:59" (2/3) ... [2021-12-17 08:08:59,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6933777a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:08:59, skipping insertion in model container [2021-12-17 08:08:59,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:08:59" (3/3) ... [2021-12-17 08:08:59,398 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2021-12-17 08:08:59,401 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:08:59,401 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:08:59,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:08:59,439 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:08:59,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:08:59,462 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) [2021-12-17 08:08:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 08:08:59,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:08:59,466 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:08:59,466 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:08:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:08:59,469 INFO L85 PathProgramCache]: Analyzing trace with hash -431383929, now seen corresponding path program 1 times [2021-12-17 08:08:59,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:08:59,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524637459] [2021-12-17 08:08:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:08:59,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:08:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:08:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 08:08:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:08:59,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 08:08:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:08:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-17 08:08:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:08:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:08:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:08:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 08:08:59,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:08:59,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524637459] [2021-12-17 08:08:59,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524637459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:08:59,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:08:59,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:08:59,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253424498] [2021-12-17 08:08:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:08:59,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:08:59,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:08:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:08:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:08:59,733 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) [2021-12-17 08:08:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:08:59,862 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2021-12-17 08:08:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 08:08:59,872 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 [2021-12-17 08:08:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:08:59,878 INFO L225 Difference]: With dead ends: 82 [2021-12-17 08:08:59,878 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 08:08:59,881 INFO L932 BasicCegarLoop]: 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 [2021-12-17 08:08:59,886 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:08:59,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:08:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 08:08:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2021-12-17 08:08:59,922 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) [2021-12-17 08:08:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2021-12-17 08:08:59,925 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2021-12-17 08:08:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:08:59,925 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-12-17 08:08:59,926 INFO L471 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) [2021-12-17 08:08:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2021-12-17 08:08:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 08:08:59,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:08:59,928 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:08:59,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:08:59,929 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:08:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:08:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -621686623, now seen corresponding path program 1 times [2021-12-17 08:08:59,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:08:59,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144470003] [2021-12-17 08:08:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:08:59,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:08:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:08:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 08:08:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-17 08:09:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-17 08:09:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:09:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 08:09:00,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144470003] [2021-12-17 08:09:00,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144470003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:09:00,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:09:00,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 08:09:00,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705472406] [2021-12-17 08:09:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:09:00,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:09:00,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:09:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:09:00,041 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) [2021-12-17 08:09:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:00,166 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2021-12-17 08:09:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:09:00,167 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 [2021-12-17 08:09:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:00,172 INFO L225 Difference]: With dead ends: 75 [2021-12-17 08:09:00,173 INFO L226 Difference]: Without dead ends: 46 [2021-12-17 08:09:00,176 INFO L932 BasicCegarLoop]: 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 [2021-12-17 08:09:00,178 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:00,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:09:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-17 08:09:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2021-12-17 08:09:00,185 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) [2021-12-17 08:09:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2021-12-17 08:09:00,186 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2021-12-17 08:09:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:00,186 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2021-12-17 08:09:00,186 INFO L471 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) [2021-12-17 08:09:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2021-12-17 08:09:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 08:09:00,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:00,188 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:00,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:09:00,188 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1110999905, now seen corresponding path program 1 times [2021-12-17 08:09:00,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:00,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907757739] [2021-12-17 08:09:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:00,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 08:09:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 08:09:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 08:09:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:09:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 08:09:00,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:00,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907757739] [2021-12-17 08:09:00,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907757739] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692047344] [2021-12-17 08:09:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:00,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:00,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:00,282 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) [2021-12-17 08:09:00,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 08:09:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 08:09:00,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:00,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:09:00,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692047344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:09:00,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:09:00,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2021-12-17 08:09:00,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027734464] [2021-12-17 08:09:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:09:00,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:09:00,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:09:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:09:00,428 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) [2021-12-17 08:09:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:00,439 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2021-12-17 08:09:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:09:00,440 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 [2021-12-17 08:09:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:00,441 INFO L225 Difference]: With dead ends: 58 [2021-12-17 08:09:00,441 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 08:09:00,442 INFO L932 BasicCegarLoop]: 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 [2021-12-17 08:09:00,443 INFO L933 BasicCegarLoop]: 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 [2021-12-17 08:09:00,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:09:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 08:09:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2021-12-17 08:09:00,462 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) [2021-12-17 08:09:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2021-12-17 08:09:00,463 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2021-12-17 08:09:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:00,463 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2021-12-17 08:09:00,463 INFO L471 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) [2021-12-17 08:09:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2021-12-17 08:09:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 08:09:00,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:00,464 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:00,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:00,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:00,682 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1230450813, now seen corresponding path program 1 times [2021-12-17 08:09:00,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:00,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353212315] [2021-12-17 08:09:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:00,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 08:09:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 08:09:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 08:09:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 08:09:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:00,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:00,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353212315] [2021-12-17 08:09:00,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353212315] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:00,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786143412] [2021-12-17 08:09:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:00,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:00,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:00,773 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) [2021-12-17 08:09:00,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 08:09:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:00,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 08:09:00,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:00,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:01,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786143412] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:01,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:01,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2021-12-17 08:09:01,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357811882] [2021-12-17 08:09:01,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:01,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:09:01,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:01,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:09:01,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:09:01,030 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) [2021-12-17 08:09:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:01,140 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-12-17 08:09:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 08:09:01,142 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 [2021-12-17 08:09:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:01,143 INFO L225 Difference]: With dead ends: 78 [2021-12-17 08:09:01,143 INFO L226 Difference]: Without dead ends: 48 [2021-12-17 08:09:01,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-17 08:09:01,144 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:01,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 69 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:09:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-17 08:09:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2021-12-17 08:09:01,150 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) [2021-12-17 08:09:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2021-12-17 08:09:01,151 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2021-12-17 08:09:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:01,151 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2021-12-17 08:09:01,151 INFO L471 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) [2021-12-17 08:09:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2021-12-17 08:09:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:09:01,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:01,152 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:01,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:01,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 08:09:01,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 828026235, now seen corresponding path program 2 times [2021-12-17 08:09:01,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:01,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396964101] [2021-12-17 08:09:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:01,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:01,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:01,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396964101] [2021-12-17 08:09:01,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396964101] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:01,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3520065] [2021-12-17 08:09:01,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:09:01,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:01,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:01,758 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) [2021-12-17 08:09:01,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 08:09:01,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-17 08:09:01,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:09:01,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 08:09:01,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:01,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:09:02,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:09:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:02,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:09:02,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3520065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:09:02,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:09:02,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2021-12-17 08:09:02,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437125938] [2021-12-17 08:09:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:09:02,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:09:02,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:09:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2021-12-17 08:09:02,031 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 08:09:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:02,190 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2021-12-17 08:09:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 08:09:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 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 [2021-12-17 08:09:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:02,192 INFO L225 Difference]: With dead ends: 79 [2021-12-17 08:09:02,192 INFO L226 Difference]: Without dead ends: 68 [2021-12-17 08:09:02,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-12-17 08:09:02,193 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:02,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 123 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:09:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-17 08:09:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2021-12-17 08:09:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2021-12-17 08:09:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2021-12-17 08:09:02,201 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 37 [2021-12-17 08:09:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:02,201 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2021-12-17 08:09:02,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 08:09:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2021-12-17 08:09:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 08:09:02,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:02,202 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:02,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:02,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:02,407 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2143087823, now seen corresponding path program 1 times [2021-12-17 08:09:02,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:02,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543814590] [2021-12-17 08:09:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:02,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:02,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:02,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543814590] [2021-12-17 08:09:02,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543814590] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:02,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966133744] [2021-12-17 08:09:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:02,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:02,681 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) [2021-12-17 08:09:02,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 08:09:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:02,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-17 08:09:02,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:03,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-17 08:09:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:03,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:09:03,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:09:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:03,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:03,513 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:03,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2021-12-17 08:09:03,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-12-17 08:09:03,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-17 08:09:03,597 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:03,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-17 08:09:03,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:09:03,604 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:03,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-12-17 08:09:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:03,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966133744] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:03,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:03,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2021-12-17 08:09:03,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280802743] [2021-12-17 08:09:03,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:03,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 08:09:03,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 08:09:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1498, Unknown=0, NotChecked=0, Total=1640 [2021-12-17 08:09:03,824 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 41 states, 37 states have (on average 1.864864864864865) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-17 08:09:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:04,840 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2021-12-17 08:09:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 08:09:04,841 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.864864864864865) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 40 [2021-12-17 08:09:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:04,842 INFO L225 Difference]: With dead ends: 131 [2021-12-17 08:09:04,842 INFO L226 Difference]: Without dead ends: 105 [2021-12-17 08:09:04,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=2902, Unknown=0, NotChecked=0, Total=3306 [2021-12-17 08:09:04,843 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 418 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:04,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 139 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 08:09:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-17 08:09:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2021-12-17 08:09:04,852 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) [2021-12-17 08:09:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2021-12-17 08:09:04,853 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 40 [2021-12-17 08:09:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:04,853 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2021-12-17 08:09:04,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.864864864864865) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-17 08:09:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2021-12-17 08:09:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 08:09:04,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:04,855 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:04,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:05,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:05,074 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1706015329, now seen corresponding path program 1 times [2021-12-17 08:09:05,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:05,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622995214] [2021-12-17 08:09:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:05,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-17 08:09:05,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:05,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622995214] [2021-12-17 08:09:05,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622995214] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:05,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085640246] [2021-12-17 08:09:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:05,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:05,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:05,320 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) [2021-12-17 08:09:05,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 08:09:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:05,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 08:09:05,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:05,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:09:05,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:09:05,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:05,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:05,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-17 08:09:05,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:05,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-17 08:09:05,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:09:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 08:09:05,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:06,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 Int) (v_ArrVal_661 (Array Int Int)) (v_f_~i~1_27 Int)) (or (= (select (store (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_661) |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| (* v_f_~i~1_27 4)) v_ArrVal_662) |c_~#pstate~0.offset|) 1) (< v_f_~i~1_27 1))) is different from false [2021-12-17 08:09:06,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085640246] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:06,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:09:06,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-12-17 08:09:06,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264259211] [2021-12-17 08:09:06,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:06,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-17 08:09:06,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:06,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-17 08:09:06,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=444, Unknown=7, NotChecked=44, Total=600 [2021-12-17 08:09:06,003 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) [2021-12-17 08:09:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:06,802 INFO L93 Difference]: Finished difference Result 196 states and 242 transitions. [2021-12-17 08:09:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-17 08:09:06,803 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 [2021-12-17 08:09:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:06,804 INFO L225 Difference]: With dead ends: 196 [2021-12-17 08:09:06,804 INFO L226 Difference]: Without dead ends: 180 [2021-12-17 08:09:06,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=2080, Unknown=37, NotChecked=100, Total=2756 [2021-12-17 08:09:06,806 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 327 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:06,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 140 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 426 Invalid, 0 Unknown, 65 Unchecked, 0.3s Time] [2021-12-17 08:09:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-17 08:09:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2021-12-17 08:09:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 84 states have internal predecessors, (102), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2021-12-17 08:09:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2021-12-17 08:09:06,831 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 40 [2021-12-17 08:09:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:06,831 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2021-12-17 08:09:06,832 INFO L471 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) [2021-12-17 08:09:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2021-12-17 08:09:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 08:09:06,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:06,833 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:06,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:07,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:07,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -309149075, now seen corresponding path program 1 times [2021-12-17 08:09:07,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:07,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64238682] [2021-12-17 08:09:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:07,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-17 08:09:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 08:09:07,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:07,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64238682] [2021-12-17 08:09:07,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64238682] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:07,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360977494] [2021-12-17 08:09:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:07,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:07,089 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) [2021-12-17 08:09:07,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 08:09:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 08:09:07,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-17 08:09:07,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 08:09:07,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360977494] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:07,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:07,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2021-12-17 08:09:07,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28448274] [2021-12-17 08:09:07,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:07,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:09:07,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:07,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:09:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:09:07,294 INFO L87 Difference]: Start difference. First operand 106 states and 133 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) [2021-12-17 08:09:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:07,388 INFO L93 Difference]: Finished difference Result 188 states and 239 transitions. [2021-12-17 08:09:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 08:09:07,388 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 [2021-12-17 08:09:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:07,389 INFO L225 Difference]: With dead ends: 188 [2021-12-17 08:09:07,389 INFO L226 Difference]: Without dead ends: 120 [2021-12-17 08:09:07,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-12-17 08:09:07,391 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:07,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 80 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:09:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-17 08:09:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2021-12-17 08:09:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 90 states have internal predecessors, (108), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2021-12-17 08:09:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2021-12-17 08:09:07,398 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2021-12-17 08:09:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:07,399 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2021-12-17 08:09:07,399 INFO L471 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) [2021-12-17 08:09:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2021-12-17 08:09:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 08:09:07,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:07,400 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:07,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:07,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:07,616 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:07,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:07,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1965354537, now seen corresponding path program 1 times [2021-12-17 08:09:07,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:07,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858921688] [2021-12-17 08:09:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:07,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:07,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:07,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858921688] [2021-12-17 08:09:07,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858921688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:07,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201552388] [2021-12-17 08:09:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:07,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:07,840 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) [2021-12-17 08:09:07,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 08:09:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:07,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 08:09:07,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:08,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:09:08,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:09:08,182 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:08,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-17 08:09:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:08,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:08,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-17 08:09:08,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-12-17 08:09:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 08:09:08,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201552388] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:08,341 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:08,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2021-12-17 08:09:08,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348441209] [2021-12-17 08:09:08,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:08,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 08:09:08,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:08,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 08:09:08,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-12-17 08:09:08,346 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 19 states have internal predecessors, (70), 4 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 08:09:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:09,140 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2021-12-17 08:09:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 08:09:09,141 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 19 states have internal predecessors, (70), 4 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 43 [2021-12-17 08:09:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:09,142 INFO L225 Difference]: With dead ends: 186 [2021-12-17 08:09:09,142 INFO L226 Difference]: Without dead ends: 160 [2021-12-17 08:09:09,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=382, Invalid=1688, Unknown=0, NotChecked=0, Total=2070 [2021-12-17 08:09:09,144 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 130 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:09,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 200 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 08:09:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-17 08:09:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-12-17 08:09:09,154 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, (24), 16 states have call predecessors, (24), 11 states have call successors, (24) [2021-12-17 08:09:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2021-12-17 08:09:09,155 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 43 [2021-12-17 08:09:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:09,156 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2021-12-17 08:09:09,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 19 states have internal predecessors, (70), 4 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-17 08:09:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2021-12-17 08:09:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-17 08:09:09,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:09,157 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:09,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:09,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:09,376 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1392073365, now seen corresponding path program 2 times [2021-12-17 08:09:09,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607704982] [2021-12-17 08:09:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:09,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-17 08:09:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:09,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:09,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607704982] [2021-12-17 08:09:09,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607704982] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:09,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055689381] [2021-12-17 08:09:09,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:09:09,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:09,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:09,716 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) [2021-12-17 08:09:09,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 08:09:09,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:09:09,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:09:09,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-17 08:09:09,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:09,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 08:09:09,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:09,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:09:09,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-12-17 08:09:09,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:09,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:09:10,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:10,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-17 08:09:10,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:10,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-17 08:09:10,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:10,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:09:10,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:10,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:09:10,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:09:10,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:09:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:09:10,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:10,642 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1059 Int)) (= (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| (* |c_ULTIMATE.start_init_~i~0#1| 4)) v_ArrVal_1059)) |c_~#pstate~0.base| v_ArrVal_1058) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_1062 Int) (v_ArrVal_1061 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_init_~i~0#1| 4)) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1061) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))) is different from false [2021-12-17 08:09:10,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_init_~i~0#1_16| Int)) (or (< |v_ULTIMATE.start_init_~i~0#1_16| (+ |c_ULTIMATE.start_init_~i~0#1| 1)) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1061 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_16| 4) |c_~#pp~0.offset|) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1061) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1059 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_16| 4) |c_~#pp~0.offset|) v_ArrVal_1059)) |c_~#pstate~0.base| v_ArrVal_1058) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))))) is different from false [2021-12-17 08:09:10,684 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:10,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2021-12-17 08:09:10,689 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:10,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 82 [2021-12-17 08:09:10,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2021-12-17 08:09:10,701 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:10,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 134 [2021-12-17 08:09:10,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 168 [2021-12-17 08:09:10,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 180 [2021-12-17 08:09:10,736 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:10,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 198 [2021-12-17 08:09:10,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 210 [2021-12-17 08:09:10,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 173 [2021-12-17 08:09:10,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2021-12-17 08:09:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2021-12-17 08:09:10,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055689381] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:10,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:10,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 11] total 36 [2021-12-17 08:09:10,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204920241] [2021-12-17 08:09:10,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:10,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-17 08:09:10,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-17 08:09:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=995, Unknown=2, NotChecked=130, Total=1260 [2021-12-17 08:09:10,869 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 5 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2021-12-17 08:09:12,970 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* |c_ULTIMATE.start_init_~i~0#1| 4)))) (and (forall ((|v_ULTIMATE.start_init_~i~0#1_16| Int)) (or (< |v_ULTIMATE.start_init_~i~0#1_16| (+ |c_ULTIMATE.start_init_~i~0#1| 1)) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1061 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_16| 4) |c_~#pp~0.offset|) v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1061) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1059 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* |v_ULTIMATE.start_init_~i~0#1_16| 4) |c_~#pp~0.offset|) v_ArrVal_1059)) |c_~#pstate~0.base| v_ArrVal_1058) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0))))) (= |c_ULTIMATE.start_init_~i~0#1| 0) (= |c_~#pp~0.offset| 0) (<= |c_~#pp~0.base| 4) (<= 5 |c_~#pstate~0.base|) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0) 0))) is different from false [2021-12-17 08:09:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:13,858 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2021-12-17 08:09:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 08:09:13,859 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 5 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 43 [2021-12-17 08:09:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:13,859 INFO L225 Difference]: With dead ends: 199 [2021-12-17 08:09:13,859 INFO L226 Difference]: Without dead ends: 118 [2021-12-17 08:09:13,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=378, Invalid=1983, Unknown=3, NotChecked=288, Total=2652 [2021-12-17 08:09:13,861 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 172 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:13,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 114 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 776 Invalid, 0 Unknown, 104 Unchecked, 0.4s Time] [2021-12-17 08:09:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-17 08:09:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2021-12-17 08:09:13,866 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) [2021-12-17 08:09:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2021-12-17 08:09:13,866 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 43 [2021-12-17 08:09:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:13,866 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2021-12-17 08:09:13,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 31 states have internal predecessors, (78), 5 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2021-12-17 08:09:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2021-12-17 08:09:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 08:09:13,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:13,867 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:13,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:14,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 08:09:14,080 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2069113328, now seen corresponding path program 1 times [2021-12-17 08:09:14,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:14,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140440627] [2021-12-17 08:09:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:14,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-17 08:09:14,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140440627] [2021-12-17 08:09:14,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140440627] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:14,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695842382] [2021-12-17 08:09:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:14,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:14,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:14,299 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) [2021-12-17 08:09:14,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 08:09:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:14,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-17 08:09:14,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:14,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-17 08:09:14,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:14,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:09:14,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 08:09:14,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:14,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:09:14,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:14,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:09:14,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 08:09:15,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:09:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:09:15,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:15,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 Int) (v_ArrVal_1187 (Array Int 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_1186)) |c_~#pstate~0.base| v_ArrVal_1187) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2021-12-17 08:09:15,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695842382] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:15,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:09:15,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 32 [2021-12-17 08:09:15,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201058481] [2021-12-17 08:09:15,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:15,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-17 08:09:15,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:15,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-17 08:09:15,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1277, Unknown=12, NotChecked=72, Total=1482 [2021-12-17 08:09:15,369 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 32 states, 30 states have (on average 2.1) internal successors, (63), 23 states have internal predecessors, (63), 5 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 08:09:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:16,464 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2021-12-17 08:09:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 08:09:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 23 states have internal predecessors, (63), 5 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2021-12-17 08:09:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:16,465 INFO L225 Difference]: With dead ends: 147 [2021-12-17 08:09:16,465 INFO L226 Difference]: Without dead ends: 121 [2021-12-17 08:09:16,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=353, Invalid=2827, Unknown=16, NotChecked=110, Total=3306 [2021-12-17 08:09:16,467 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 160 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:16,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 138 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1159 Invalid, 0 Unknown, 92 Unchecked, 0.5s Time] [2021-12-17 08:09:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-17 08:09:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2021-12-17 08:09:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 86 states have internal predecessors, (105), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-17 08:09:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2021-12-17 08:09:16,473 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 45 [2021-12-17 08:09:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:16,473 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2021-12-17 08:09:16,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 23 states have internal predecessors, (63), 5 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-17 08:09:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2021-12-17 08:09:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 08:09:16,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:16,474 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:16,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:16,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:16,687 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 707980166, now seen corresponding path program 1 times [2021-12-17 08:09:16,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:16,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443997564] [2021-12-17 08:09:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:16,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:09:16,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443997564] [2021-12-17 08:09:16,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443997564] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:16,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623659645] [2021-12-17 08:09:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:16,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:16,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:16,760 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) [2021-12-17 08:09:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 08:09:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:16,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 08:09:16,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:09:16,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:09:16,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623659645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:09:16,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:09:16,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2021-12-17 08:09:16,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108926294] [2021-12-17 08:09:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:09:16,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:09:16,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:09:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 08:09:16,947 INFO L87 Difference]: Start difference. First operand 105 states and 124 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) [2021-12-17 08:09:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:16,980 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2021-12-17 08:09:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 08:09:16,981 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 [2021-12-17 08:09:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:16,982 INFO L225 Difference]: With dead ends: 177 [2021-12-17 08:09:16,982 INFO L226 Difference]: Without dead ends: 105 [2021-12-17 08:09:16,982 INFO L932 BasicCegarLoop]: 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 [2021-12-17 08:09:16,982 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:16,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:09:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-17 08:09:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2021-12-17 08:09:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 85 states have internal predecessors, (98), 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) [2021-12-17 08:09:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2021-12-17 08:09:16,990 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2021-12-17 08:09:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:16,990 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2021-12-17 08:09:16,990 INFO L471 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) [2021-12-17 08:09:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2021-12-17 08:09:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-17 08:09:16,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:16,991 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:17,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:17,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 08:09:17,203 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:17,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 278730410, now seen corresponding path program 1 times [2021-12-17 08:09:17,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:17,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137915209] [2021-12-17 08:09:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:17,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 08:09:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 08:09:17,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:17,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137915209] [2021-12-17 08:09:17,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137915209] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:17,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571130972] [2021-12-17 08:09:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:17,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:17,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:17,734 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) [2021-12-17 08:09:17,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 08:09:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:17,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-17 08:09:17,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:18,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:18,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:09:18,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:09:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:09:18,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:18,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-12-17 08:09:18,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-17 08:09:18,853 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_~#pp~0.base| |c_~#pstate~0.base|) (forall ((v_ArrVal_1538 (Array Int Int))) (= |c_g_#in~pointer#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1538) |c_~#pp~0.base|) |c_~#pp~0.offset|)))) is different from false [2021-12-17 08:09:18,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:09:18,907 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:18,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-17 08:09:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 08:09:19,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571130972] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:19,267 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:19,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 53 [2021-12-17 08:09:19,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325606011] [2021-12-17 08:09:19,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:19,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-17 08:09:19,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:19,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-17 08:09:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2480, Unknown=2, NotChecked=100, Total=2756 [2021-12-17 08:09:19,269 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 53 states, 47 states have (on average 2.021276595744681) internal successors, (95), 37 states have internal predecessors, (95), 12 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-17 08:09:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:21,253 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2021-12-17 08:09:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 08:09:21,253 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 47 states have (on average 2.021276595744681) internal successors, (95), 37 states have internal predecessors, (95), 12 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) Word has length 53 [2021-12-17 08:09:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:21,254 INFO L225 Difference]: With dead ends: 161 [2021-12-17 08:09:21,254 INFO L226 Difference]: Without dead ends: 115 [2021-12-17 08:09:21,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=537, Invalid=5627, Unknown=2, NotChecked=154, Total=6320 [2021-12-17 08:09:21,256 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 181 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:21,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 161 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1959 Invalid, 0 Unknown, 176 Unchecked, 0.8s Time] [2021-12-17 08:09:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-17 08:09:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2021-12-17 08:09:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.0975609756097562) internal successors, (90), 83 states have internal predecessors, (90), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 08:09:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2021-12-17 08:09:21,262 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 53 [2021-12-17 08:09:21,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:21,262 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2021-12-17 08:09:21,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 47 states have (on average 2.021276595744681) internal successors, (95), 37 states have internal predecessors, (95), 12 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-12-17 08:09:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2021-12-17 08:09:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-17 08:09:21,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:21,263 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:09:21,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-17 08:09:21,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 08:09:21,479 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -689119104, now seen corresponding path program 2 times [2021-12-17 08:09:21,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:21,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209634978] [2021-12-17 08:09:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:21,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:21,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:21,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-17 08:09:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 08:09:22,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209634978] [2021-12-17 08:09:22,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209634978] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052288690] [2021-12-17 08:09:22,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:09:22,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:22,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:22,192 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) [2021-12-17 08:09:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 08:09:22,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:09:22,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:09:22,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 54 conjunts are in the unsatisfiable core [2021-12-17 08:09:22,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:22,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-17 08:09:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:22,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:09:22,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 08:09:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:23,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:23,439 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:23,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-17 08:09:23,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-12-17 08:09:23,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-12-17 08:09:23,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:23,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-17 08:09:23,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:09:23,527 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:09:23,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-17 08:09:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:09:23,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052288690] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:09:23,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:09:23,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 19] total 64 [2021-12-17 08:09:23,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512892453] [2021-12-17 08:09:23,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:23,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-17 08:09:23,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-17 08:09:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3785, Unknown=0, NotChecked=0, Total=4032 [2021-12-17 08:09:23,918 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 64 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 49 states have internal predecessors, (112), 13 states have call successors, (16), 9 states have call predecessors, (16), 15 states have return successors, (15), 13 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-17 08:09:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:26,107 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-12-17 08:09:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-17 08:09:26,108 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 49 states have internal predecessors, (112), 13 states have call successors, (16), 9 states have call predecessors, (16), 15 states have return successors, (15), 13 states have call predecessors, (15), 12 states have call successors, (15) Word has length 53 [2021-12-17 08:09:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:26,108 INFO L225 Difference]: With dead ends: 130 [2021-12-17 08:09:26,108 INFO L226 Difference]: Without dead ends: 64 [2021-12-17 08:09:26,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=765, Invalid=8547, Unknown=0, NotChecked=0, Total=9312 [2021-12-17 08:09:26,110 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 313 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:26,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 76 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 08:09:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-17 08:09:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2021-12-17 08:09:26,114 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) [2021-12-17 08:09:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-12-17 08:09:26,115 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2021-12-17 08:09:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:26,115 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-12-17 08:09:26,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 49 states have internal predecessors, (112), 13 states have call successors, (16), 9 states have call predecessors, (16), 15 states have return successors, (15), 13 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-17 08:09:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-12-17 08:09:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 08:09:26,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:09:26,116 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 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] [2021-12-17 08:09:26,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-17 08:09:26,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 08:09:26,328 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:09:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:09:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash -535060263, now seen corresponding path program 1 times [2021-12-17 08:09:26,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:09:26,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864401320] [2021-12-17 08:09:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:26,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:09:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 08:09:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:09:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-17 08:09:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:09:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 08:09:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-17 08:09:26,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:09:26,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864401320] [2021-12-17 08:09:26,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864401320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:26,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100948374] [2021-12-17 08:09:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:09:26,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:09:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:09:26,694 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:09:26,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 08:09:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:09:26,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-17 08:09:26,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:09:26,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-17 08:09:26,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:26,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:09:27,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 08:09:27,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:27,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:09:27,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:27,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:09:27,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 08:09:27,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-17 08:09:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:09:27,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:09:27,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:09:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 32 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:09:27,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:09:27,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1867 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| v_ArrVal_1867) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2021-12-17 08:09:27,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100948374] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:09:27,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:09:27,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 38 [2021-12-17 08:09:27,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514693866] [2021-12-17 08:09:27,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:09:27,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-17 08:09:27,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:09:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-17 08:09:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1650, Unknown=31, NotChecked=82, Total=1892 [2021-12-17 08:09:27,993 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 32 states have internal predecessors, (85), 6 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 08:09:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:09:28,975 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-17 08:09:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 08:09:28,976 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 32 states have internal predecessors, (85), 6 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 58 [2021-12-17 08:09:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:09:28,976 INFO L225 Difference]: With dead ends: 60 [2021-12-17 08:09:28,976 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 08:09:28,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=292, Invalid=3182, Unknown=70, NotChecked=116, Total=3660 [2021-12-17 08:09:28,977 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 08:09:28,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 83 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 521 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2021-12-17 08:09:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 08:09:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 08:09:28,979 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) [2021-12-17 08:09:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 08:09:28,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2021-12-17 08:09:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:09:28,979 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 08:09:28,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 32 states have internal predecessors, (85), 6 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 08:09:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 08:09:28,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 08:09:28,981 INFO L764 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 08:09:29,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-17 08:09:29,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 08:09:29,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 08:09:30,554 INFO L858 garLoopResultBuilder]: For program point mallocFINAL(lines 48 51) no Hoare annotation was computed. [2021-12-17 08:09:30,554 INFO L858 garLoopResultBuilder]: For program point mallocEXIT(lines 48 51) no Hoare annotation was computed. [2021-12-17 08:09:30,554 INFO L854 garLoopResultBuilder]: At program point mallocENTRY(lines 48 51) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse8 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (not (= (select .cse8 (+ |~#pp~0.offset| 4)) 0))) (.cse1 (not (= (select .cse9 4) 0))) (.cse2 (not (= (select .cse9 0) 0))) (.cse3 (not (= (select .cse8 |~#pp~0.offset|) 0))) (.cse4 (not (= |~#pstate~0.offset| 0))) (.cse5 (not (<= 5 |~#pstate~0.base|))) (.cse6 (not (= |~#pp~0.offset| 0))) (.cse7 (not (<= |~#pp~0.base| 4)))) (and (or (= ~counter~0 2) .cse0 (not (= |old(~counter~0)| 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~counter~0)| 1)) .cse0 (= ~counter~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2021-12-17 08:09:30,554 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2021-12-17 08:09:30,554 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2021-12-17 08:09:30,554 INFO L854 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse11 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse12 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse3 (not (= (select .cse12 (+ |~#pp~0.offset| 4)) 0))) (.cse4 (and .cse0 .cse1 (= f_~pointer.offset |f_#in~pointer.offset|) (= f_~i~1 0) .cse2 (= f_~pointer.base |f_#in~pointer.base|))) (.cse5 (not (= (select .cse11 4) 0))) (.cse7 (not (= |~#pstate~0.offset| 0))) (.cse8 (not (<= 5 |~#pstate~0.base|))) (.cse6 (select .cse12 |~#pp~0.offset|)) (.cse9 (not (= |~#pp~0.offset| 0))) (.cse10 (not (<= |~#pp~0.base| 4)))) (and (or (and .cse0 .cse1 (= f_~i~1 1) .cse2 (= |f_#in~pointer.offset| f_~pointer.offset)) .cse3 .cse4 .cse5 (not (= .cse6 1)) .cse7 .cse8 .cse9 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|) 1)) .cse10) (or .cse3 .cse4 (not (= (select .cse11 0) 0)) .cse5 .cse7 .cse8 (not (= .cse6 0)) .cse9 .cse10)))) [2021-12-17 08:09:30,554 INFO L858 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L854 garLoopResultBuilder]: At program point fENTRY(lines 25 34) the Hoare annotation is: (let ((.cse8 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse9 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (not (= (select .cse9 (+ |~#pp~0.offset| 4)) 0))) (.cse1 (not (= (select .cse8 4) 0))) (.cse2 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse4 (not (= |~#pstate~0.offset| 0))) (.cse5 (not (<= 5 |~#pstate~0.base|))) (.cse3 (select .cse9 |~#pp~0.offset|)) (.cse6 (not (= |~#pp~0.offset| 0))) (.cse7 (not (<= |~#pp~0.base| 4)))) (and (or .cse0 .cse1 .cse2 (not (= .cse3 1)) .cse4 .cse5 .cse6 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|) 1)) .cse7) (or .cse0 (not (= (select .cse8 0) 0)) .cse1 .cse2 .cse4 .cse5 (not (= .cse3 0)) .cse6 .cse7)))) [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L854 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse19 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse25 (select .cse19 |~#pp~0.offset|)) (.cse31 (= (select .cse1 |~#pp~0.offset|) 0)) (.cse12 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse27 (= |~#pp~0.offset| 0)) (.cse17 (= (select .cse12 4) 1)) (.cse26 (<= |~#pp~0.base| 4)) (.cse28 (<= 5 |~#pstate~0.base|)) (.cse5 (= |~#pstate~0.offset| 0)) (.cse29 (or (not (= 0 .cse25)) .cse31)) (.cse21 (<= 2 |g_~i~2#1|)) (.cse30 (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) 0)) (and (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|) 0) (= .cse25 0)) (not .cse31))) (.cse4 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse13 (* |g_~i~2#1| 4)) (.cse10 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse14 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse0 (not (= (select .cse4 4) 1))) (.cse2 (and .cse29 .cse21 .cse30)) (.cse3 (and .cse29 .cse27 .cse17 (= |g_~i~2#1| 1) .cse26 .cse28 .cse5 .cse30)) (.cse22 (not (<= |~#pstate~0.offset| 0))) (.cse23 (not (<= 0 |~#pstate~0.offset|))) (.cse6 (not .cse28)) (.cse7 (not .cse27)) (.cse24 (not (= (select .cse4 |~#pstate~0.offset|) 1))) (.cse8 (not .cse26)) (.cse9 (= |#memory_int| |old(#memory_int)|)) (.cse11 (= |g_~i~2#1| 0))) (and (or .cse0 (not (= (select .cse1 0) 1)) .cse2 .cse3 (not (= |g_#in~pointer#1.offset| (select .cse4 0))) (not (= |g_#in~pointer#1.offset| 2)) (not .cse5) .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 (= |g_~pointer#1.offset| (select .cse12 (+ |~#pstate~0.offset| .cse13))) .cse14)) (let ((.cse18 (= (select .cse1 (+ |~#pp~0.offset| 4)) |g_#in~pointer#1.offset|)) (.cse15 (= (select .cse1 4) (select .cse19 4))) (.cse16 (= .cse25 |g_#in~pointer#1.offset|)) (.cse20 (= 2 (select .cse12 0)))) (or .cse0 (and .cse15 .cse16 .cse17 (or .cse18 (not (= (select .cse19 (+ .cse13 |~#pp~0.offset|)) |g_~pointer#1.offset|))) .cse20) (and .cse18 .cse15 .cse21) .cse22 (and .cse9 .cse10 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|) .cse14) (and .cse9 .cse10 .cse21 .cse14) .cse23 (and .cse16 .cse17 .cse21 .cse20) .cse6 .cse7 .cse24 .cse8)) (or .cse0 .cse2 .cse3 .cse22 .cse23 .cse6 .cse7 .cse24 .cse8 (and .cse9 .cse11))))))) [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2021-12-17 08:09:30,555 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 9) no Hoare annotation was computed. [2021-12-17 08:09:30,556 INFO L854 garLoopResultBuilder]: At program point gENTRY(lines 36 45) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= (select .cse1 4) 1))) (.cse2 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse3 (not (= |~#pstate~0.offset| 0))) (.cse4 (not (<= 5 |~#pstate~0.base|))) (.cse5 (not (= |~#pp~0.offset| 0))) (.cse6 (not (<= |~#pp~0.base| 4)))) (and (or .cse0 (not (= (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0) 1)) (not (= |g_#in~pointer#1.offset| (select .cse1 0))) (not (= |g_#in~pointer#1.offset| 2)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (= (select .cse1 |~#pstate~0.offset|) 1)) .cse6)))) [2021-12-17 08:09:30,556 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 08:09:30,556 INFO L854 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse6 (select .cse8 0)) (.cse0 (= |~#pp~0.offset| 0)) (.cse1 (= (select .cse8 4) 1)) (.cse2 (<= |~#pp~0.base| 4)) (.cse3 (<= 5 |~#pstate~0.base|)) (.cse5 (= 0 |ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (= |~#pstate~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~a~0#1.offset| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 .cse6) .cse7) (and (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= |ULTIMATE.start_main_~b~0#1.offset| .cse6) .cse0 (not (= |ULTIMATE.start_main_~a~0#1.offset| ~counter~0)) .cse1 .cse2 .cse3 .cse5 .cse4 (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 0) 1) .cse7)))) [2021-12-17 08:09:30,556 INFO L854 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= (select .cse0 |~#pp~0.offset|) 0) (<= 5 |~#pstate~0.base|) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= (select .cse1 4) 0) (<= |~#pp~0.base| 4) (= 0 |ULTIMATE.start_main_~a~0#1.base|) (< 3 (+ |~#pp~0.offset| (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0))) [2021-12-17 08:09:30,556 INFO L854 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (<= 5 |~#pstate~0.base|) (= (select .cse1 0) |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= (select .cse1 4) 0) (= (select .cse1 |~#pp~0.offset|) 1) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= (select .cse0 0) |ULTIMATE.start_main_~a~0#1.base|) (<= |~#pp~0.base| 4) (= 0 |ULTIMATE.start_main_~a~0#1.base|) (= |~#pstate~0.offset| 0))) [2021-12-17 08:09:30,556 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= ~counter~0 2) (= (select .cse0 |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (= (select .cse1 4) 0) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= 0 |ULTIMATE.start_main_~a~0#1.base|) (< 3 (+ |~#pp~0.offset| (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1))) [2021-12-17 08:09:30,556 INFO L858 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2021-12-17 08:09:30,566 INFO L858 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L854 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse6 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (let ((.cse0 (= (select .cse6 4) 0)) (.cse1 (= |~#pp~0.offset| 0)) (.cse2 (= ~counter~0 1)) (.cse3 (<= |~#pp~0.base| 4)) (.cse4 (<= 5 |~#pstate~0.base|)) (.cse5 (= |~#pstate~0.offset| 0)) (.cse8 (= (select .cse9 (+ |~#pp~0.offset| 4)) 0))) (or (let ((.cse7 (+ |~#pp~0.offset| (* |ULTIMATE.start_init_~i~0#1| 4)))) (and .cse0 (= |ULTIMATE.start_init_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse6 .cse7) 0) .cse8 (= (select .cse9 .cse7) 0))) (and .cse0 (= (select .cse6 |~#pp~0.offset|) 0) .cse1 .cse2 .cse3 .cse4 (< 3 (+ |~#pp~0.offset| (* 4 |ULTIMATE.start_init_~i~0#1|))) .cse5 (= (select .cse9 |~#pp~0.offset|) 0) .cse8)))) [2021-12-17 08:09:30,567 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#pstate~0.base|))) (and (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (not (= ~counter~0 |ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse0 4) 1) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pstate~0.offset| 0) (= 0 |ULTIMATE.start_main_~a~0#1.base|) (= 1 (select .cse0 0)) (not (= |ULTIMATE.start_main_~a~0#1.offset| (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) 4))))) [2021-12-17 08:09:30,567 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 4) 0) (= (select .cse0 |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (= ~counter~0 1) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (< 3 (+ |~#pp~0.offset| (* 4 |ULTIMATE.start_init_~i~0#1|))) (= |~#pstate~0.offset| 0) (= (select .cse1 |~#pp~0.offset|) 0) (= (select .cse1 (+ |~#pp~0.offset| 4)) 0))) [2021-12-17 08:09:30,567 INFO L858 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2021-12-17 08:09:30,567 INFO L861 garLoopResultBuilder]: At program point L70(lines 53 71) the Hoare annotation is: true [2021-12-17 08:09:30,568 INFO L858 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2021-12-17 08:09:30,570 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:09:30,571 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 08:09:30,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,589 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,602 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,608 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,625 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 08:09:30 BoogieIcfgContainer [2021-12-17 08:09:30,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 08:09:30,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 08:09:30,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 08:09:30,627 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 08:09:30,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:08:59" (3/4) ... [2021-12-17 08:09:30,629 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 08:09:30,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2021-12-17 08:09:30,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2021-12-17 08:09:30,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2021-12-17 08:09:30,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-12-17 08:09:30,636 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-17 08:09:30,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 08:09:30,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 08:09:30,651 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) || !(\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][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 + 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][0] == 0)) || !(\old(#memory_$Pointer$)[pp][4] == 0)) || !(pstate == 0)) || !(5 <= pstate)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)) || !(pp == 0)) || !(pp <= 4)) [2021-12-17 08:09:30,651 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(unknown-#memory_int-unknown)[pstate][4] == 1) || !(\old(#memory_$Pointer$)[pp][0] == 1)) || (((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && 2 <= i) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && unknown-#memory_int-unknown[pstate][4] == 1) && i == 1) && pp <= 4) && 5 <= pstate) && pstate == 0) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pointer == \old(unknown-#memory_int-unknown)[pstate][0])) || !(pointer == 2)) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(pp <= 4)) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i == 0) && pointer == unknown-#memory_int-unknown[pstate][pstate + i * 4]) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && (((((((((((!(\old(unknown-#memory_int-unknown)[pstate][4] == 1) || ((((\old(#memory_$Pointer$)[pp][4] == #memory_$Pointer$[pp][4] && #memory_$Pointer$[pp][pp] == pointer) && unknown-#memory_int-unknown[pstate][4] == 1) && (\old(#memory_$Pointer$)[pp][pp + 4] == pointer || !(#memory_$Pointer$[pp][i * 4 + pp] == pointer))) && 2 == unknown-#memory_int-unknown[pstate][0])) || ((\old(#memory_$Pointer$)[pp][pp + 4] == pointer && \old(#memory_$Pointer$)[pp][4] == #memory_$Pointer$[pp][4]) && 2 <= i)) || !(pstate <= 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= i) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= pstate)) || (((#memory_$Pointer$[pp][pp] == pointer && unknown-#memory_int-unknown[pstate][4] == 1) && 2 <= i) && 2 == unknown-#memory_int-unknown[pstate][0])) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4))) && (((((((((!(\old(unknown-#memory_int-unknown)[pstate][4] == 1) || (((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && 2 <= i) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && unknown-#memory_int-unknown[pstate][4] == 1) && i == 1) && pp <= 4) && 5 <= pstate) && pstate == 0) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pstate <= 0)) || !(0 <= pstate)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) || (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && i == 0)) [2021-12-17 08:09:30,658 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 08:09:30,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 08:09:30,659 INFO L158 Benchmark]: Toolchain (without parser) took 31863.88ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 59.8MB in the beginning and 79.6MB in the end (delta: -19.8MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2021-12-17 08:09:30,659 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 08:09:30,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.52ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 59.6MB in the beginning and 96.0MB in the end (delta: -36.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2021-12-17 08:09:30,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.00ms. Allocated memory is still 119.5MB. Free memory was 96.0MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 08:09:30,659 INFO L158 Benchmark]: Boogie Preprocessor took 40.00ms. Allocated memory is still 119.5MB. Free memory was 94.6MB in the beginning and 93.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:09:30,660 INFO L158 Benchmark]: RCFGBuilder took 288.68ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 81.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 08:09:30,660 INFO L158 Benchmark]: TraceAbstraction took 31233.09ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 80.6MB in the beginning and 82.7MB in the end (delta: -2.1MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2021-12-17 08:09:30,660 INFO L158 Benchmark]: Witness Printer took 31.64ms. Allocated memory is still 174.1MB. Free memory was 82.7MB in the beginning and 79.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 08:09:30,661 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.20ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.52ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 59.6MB in the beginning and 96.0MB in the end (delta: -36.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.00ms. Allocated memory is still 119.5MB. Free memory was 96.0MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.00ms. Allocated memory is still 119.5MB. Free memory was 94.6MB in the beginning and 93.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 288.68ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 81.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31233.09ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 80.6MB in the beginning and 82.7MB in the end (delta: -2.1MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. * Witness Printer took 31.64ms. Allocated memory is still 174.1MB. Free memory was 82.7MB in the beginning and 79.6MB 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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: 31.1s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2022 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2002 mSDsluCounter, 1597 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 513 IncrementalHoareTripleChecker+Unchecked, 1081 mSDsCounter, 1128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8635 IncrementalHoareTripleChecker+Invalid, 10276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1128 mSolverCounterUnsat, 516 mSDtfsCounter, 8635 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 836 SyntacticMatches, 10 SemanticMatches, 545 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 6623 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=9, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 206 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 126 PreInvPairs, 184 NumberOfFragments, 1504 HoareAnnotationTreeSize, 126 FomulaSimplifications, 8102 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 2871 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1185 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1473 ConstructedInterpolants, 18 QuantifiedInterpolants, 12190 SizeOfPredicates, 77 NumberOfNonLiveVariables, 3919 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 410/659 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 [2021-12-17 08:09:30,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,677 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,678 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,679 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,680 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,681 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,682 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,683 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,684 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,692 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,693 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,694 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,699 WARN L418 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][4] == 1) || !(\old(#memory_$Pointer$)[pp][0] == 1)) || (((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && 2 <= i) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && unknown-#memory_int-unknown[pstate][4] == 1) && i == 1) && pp <= 4) && 5 <= pstate) && pstate == 0) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pointer == \old(unknown-#memory_int-unknown)[pstate][0])) || !(pointer == 2)) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(pp <= 4)) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i == 0) && pointer == unknown-#memory_int-unknown[pstate][pstate + i * 4]) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && (((((((((((!(\old(unknown-#memory_int-unknown)[pstate][4] == 1) || ((((\old(#memory_$Pointer$)[pp][4] == #memory_$Pointer$[pp][4] && #memory_$Pointer$[pp][pp] == pointer) && unknown-#memory_int-unknown[pstate][4] == 1) && (\old(#memory_$Pointer$)[pp][pp + 4] == pointer || !(#memory_$Pointer$[pp][i * 4 + pp] == pointer))) && 2 == unknown-#memory_int-unknown[pstate][0])) || ((\old(#memory_$Pointer$)[pp][pp + 4] == pointer && \old(#memory_$Pointer$)[pp][4] == #memory_$Pointer$[pp][4]) && 2 <= i)) || !(pstate <= 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= i) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= pstate)) || (((#memory_$Pointer$[pp][pp] == pointer && unknown-#memory_int-unknown[pstate][4] == 1) && 2 <= i) && 2 == unknown-#memory_int-unknown[pstate][0])) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4))) && (((((((((!(\old(unknown-#memory_int-unknown)[pstate][4] == 1) || (((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && 2 <= i) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || ((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp == 0) && unknown-#memory_int-unknown[pstate][4] == 1) && i == 1) && pp <= 4) && 5 <= pstate) && pstate == 0) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)))) || !(pstate <= 0)) || !(0 <= pstate)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) || (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && i == 0)) - InvariantResult [Line: 27]: Loop Invariant [2021-12-17 08:09:30,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,704 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,705 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,706 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 1) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) || !(\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][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 + 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][0] == 0)) || !(\old(#memory_$Pointer$)[pp][4] == 0)) || !(pstate == 0)) || !(5 <= pstate)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)) || !(pp == 0)) || !(pp <= 4)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,707 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-17 08:09:30,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((#memory_$Pointer$[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) || (((((((((#memory_$Pointer$[pp][4] == 0 && #memory_$Pointer$[pp][pp] == 0) && pp == 0) && counter == 1) && pp <= 4) && 5 <= pstate) && 3 < pp + 4 * i) && pstate == 0) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) RESULT: Ultimate proved your program to be correct! [2021-12-17 08:09:30,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE