./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 b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:52:28,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:52:28,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:52:28,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:52:28,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:52:28,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:52:28,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:52:28,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:52:28,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:52:28,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:52:28,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:52:28,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:52:28,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:52:28,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:52:28,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:52:28,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:52:28,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:52:28,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:52:28,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:52:28,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:52:28,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:52:28,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:52:28,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:52:28,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:52:28,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:52:28,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:52:28,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:52:28,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:52:28,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:52:28,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:52:28,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:52:28,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:52:28,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:52:28,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:52:28,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:52:28,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:52:28,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:52:28,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:52:28,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:52:28,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:52:28,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:52:28,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:52:28,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:52:28,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:52:28,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:52:28,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:52:28,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:52:28,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:52:28,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:52:28,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:52:28,792 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:52:28,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:52:28,794 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:52:28,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:52:28,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:52:28,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:52:28,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:52:28,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:52:28,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:52:28,795 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:52:28,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:52:28,795 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:52:28,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:52:28,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:52:28,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:52:28,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:52:28,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:52:28,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:52:28,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:52:28,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:52:28,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:52:28,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:52:28,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:52:28,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:52:28,798 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:52:28,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:52:28,798 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:52:28,798 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2023-02-16 00:52:29,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:52:29,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:52:29,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:52:29,061 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:52:29,061 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:52:29,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-02-16 00:52:30,203 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:52:30,359 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:52:30,359 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2023-02-16 00:52:30,363 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a920c05c9/49522224769f44c6ab61f75b9ba23e7d/FLAGa9fdd371a [2023-02-16 00:52:30,373 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a920c05c9/49522224769f44c6ab61f75b9ba23e7d [2023-02-16 00:52:30,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:52:30,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:52:30,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:52:30,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:52:30,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:52:30,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54aee15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30, skipping insertion in model container [2023-02-16 00:52:30,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:52:30,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:52:30,506 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-02-16 00:52:30,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:52:30,535 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:52:30,543 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2023-02-16 00:52:30,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:52:30,561 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:52:30,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30 WrapperNode [2023-02-16 00:52:30,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:52:30,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:52:30,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:52:30,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:52:30,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,585 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2023-02-16 00:52:30,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:52:30,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:52:30,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:52:30,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:52:30,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,617 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:52:30,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:52:30,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:52:30,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:52:30,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (1/1) ... [2023-02-16 00:52:30,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:52:30,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:30,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 00:52:30,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 00:52:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 00:52:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 00:52:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-02-16 00:52:30,691 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure g [2023-02-16 00:52:30,691 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2023-02-16 00:52:30,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:52:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:52:30,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:52:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:52:30,750 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:52:30,751 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:52:30,934 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:52:30,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:52:30,940 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:52:30,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:52:30 BoogieIcfgContainer [2023-02-16 00:52:30,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:52:30,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:52:30,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:52:30,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:52:30,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:52:30" (1/3) ... [2023-02-16 00:52:30,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1139afa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:52:30, skipping insertion in model container [2023-02-16 00:52:30,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:52:30" (2/3) ... [2023-02-16 00:52:30,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1139afa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:52:30, skipping insertion in model container [2023-02-16 00:52:30,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:52:30" (3/3) ... [2023-02-16 00:52:30,976 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2023-02-16 00:52:30,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:52:31,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:52:31,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:52:31,055 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f3c2b3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:52:31,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:52:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 00:52:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:52:31,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:31,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:31,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1517633021, now seen corresponding path program 1 times [2023-02-16 00:52:31,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:31,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515960497] [2023-02-16 00:52:31,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-16 00:52:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 00:52:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-16 00:52:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 00:52:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:52:31,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515960497] [2023-02-16 00:52:31,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515960497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:52:31,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:52:31,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:52:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432564270] [2023-02-16 00:52:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:52:31,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:52:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:52:31,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:52:31,475 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:31,643 INFO L93 Difference]: Finished difference Result 82 states and 114 transitions. [2023-02-16 00:52:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:52:31,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-02-16 00:52:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:31,659 INFO L225 Difference]: With dead ends: 82 [2023-02-16 00:52:31,659 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 00:52:31,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:52:31,666 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:31,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:52:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 00:52:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2023-02-16 00:52:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:52:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-02-16 00:52:31,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 31 [2023-02-16 00:52:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:31,709 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-02-16 00:52:31,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-02-16 00:52:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:52:31,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:31,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:31,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:52:31,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1707935715, now seen corresponding path program 1 times [2023-02-16 00:52:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415704322] [2023-02-16 00:52:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-16 00:52:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 00:52:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-16 00:52:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 00:52:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:52:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:31,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415704322] [2023-02-16 00:52:31,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415704322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:52:31,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:52:31,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:52:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626104242] [2023-02-16 00:52:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:52:31,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:52:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:31,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:52:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:52:31,885 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:32,025 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2023-02-16 00:52:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:52:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-02-16 00:52:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:32,031 INFO L225 Difference]: With dead ends: 75 [2023-02-16 00:52:32,032 INFO L226 Difference]: Without dead ends: 46 [2023-02-16 00:52:32,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:52:32,033 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:32,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 41 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:52:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-16 00:52:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-02-16 00:52:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:52:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-02-16 00:52:32,045 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2023-02-16 00:52:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:32,046 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-02-16 00:52:32,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-02-16 00:52:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 00:52:32,047 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:32,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:32,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:52:32,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:32,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1895345243, now seen corresponding path program 1 times [2023-02-16 00:52:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:32,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169622883] [2023-02-16 00:52:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:32,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:52:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 00:52:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 00:52:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-16 00:52:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:52:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:32,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169622883] [2023-02-16 00:52:32,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169622883] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:32,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330731324] [2023-02-16 00:52:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:32,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:32,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:32,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:52:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 00:52:32,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 00:52:32,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:52:32,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330731324] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:52:32,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:52:32,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-02-16 00:52:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342347429] [2023-02-16 00:52:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:52:32,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:52:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:52:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:52:32,301 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 00:52:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:32,314 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2023-02-16 00:52:32,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:52:32,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2023-02-16 00:52:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:32,316 INFO L225 Difference]: With dead ends: 58 [2023-02-16 00:52:32,316 INFO L226 Difference]: Without dead ends: 39 [2023-02-16 00:52:32,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:52:32,318 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:32,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:52:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-16 00:52:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-16 00:52:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:52:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2023-02-16 00:52:32,324 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2023-02-16 00:52:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:32,325 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-02-16 00:52:32,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 00:52:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2023-02-16 00:52:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 00:52:32,326 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:32,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:32,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:52:32,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:32,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:32,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1248982919, now seen corresponding path program 1 times [2023-02-16 00:52:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:32,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731009577] [2023-02-16 00:52:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-16 00:52:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-16 00:52:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-16 00:52:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 00:52:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:32,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:32,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731009577] [2023-02-16 00:52:32,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731009577] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:32,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548874503] [2023-02-16 00:52:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:32,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:32,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:52:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:32,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:52:32,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:32,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:32,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548874503] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:32,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:32,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-02-16 00:52:32,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233237608] [2023-02-16 00:52:32,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:32,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:52:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:52:32,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:52:32,863 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-02-16 00:52:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:33,015 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2023-02-16 00:52:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:52:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 35 [2023-02-16 00:52:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:33,017 INFO L225 Difference]: With dead ends: 78 [2023-02-16 00:52:33,017 INFO L226 Difference]: Without dead ends: 48 [2023-02-16 00:52:33,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:52:33,018 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:33,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:52:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-16 00:52:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2023-02-16 00:52:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:52:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-16 00:52:33,025 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2023-02-16 00:52:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:33,025 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-16 00:52:33,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-02-16 00:52:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-16 00:52:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 00:52:33,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:33,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:33,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:33,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 00:52:33,233 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1916572233, now seen corresponding path program 2 times [2023-02-16 00:52:33,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:33,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490949806] [2023-02-16 00:52:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:33,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:33,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490949806] [2023-02-16 00:52:33,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490949806] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:52:33,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:52:33,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 00:52:33,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535555027] [2023-02-16 00:52:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:52:33,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:52:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:52:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:52:33,691 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:34,124 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2023-02-16 00:52:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 00:52:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-16 00:52:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:34,126 INFO L225 Difference]: With dead ends: 90 [2023-02-16 00:52:34,126 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 00:52:34,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-02-16 00:52:34,127 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:34,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 78 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:52:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 00:52:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2023-02-16 00:52:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 states have internal predecessors, (64), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-16 00:52:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2023-02-16 00:52:34,139 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 37 [2023-02-16 00:52:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:34,140 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2023-02-16 00:52:34,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2023-02-16 00:52:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 00:52:34,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:34,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:34,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:52:34,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1102539601, now seen corresponding path program 1 times [2023-02-16 00:52:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:34,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637953402] [2023-02-16 00:52:34,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:34,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:34,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637953402] [2023-02-16 00:52:34,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637953402] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:34,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641675416] [2023-02-16 00:52:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:34,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:34,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:34,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:34,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:52:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:34,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 00:52:34,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:35,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:52:35,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:35,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:52:35,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 00:52:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 00:52:35,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:35,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:35,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-02-16 00:52:35,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-16 00:52:35,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-16 00:52:35,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:35,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-16 00:52:35,609 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:35,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:35,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2023-02-16 00:52:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 00:52:35,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641675416] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:35,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:35,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2023-02-16 00:52:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878572693] [2023-02-16 00:52:35,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:35,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 00:52:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:35,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 00:52:35,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2023-02-16 00:52:35,846 INFO L87 Difference]: Start difference. First operand 67 states and 88 transitions. Second operand has 38 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 00:52:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:36,954 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2023-02-16 00:52:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 00:52:36,955 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 40 [2023-02-16 00:52:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:36,956 INFO L225 Difference]: With dead ends: 136 [2023-02-16 00:52:36,956 INFO L226 Difference]: Without dead ends: 105 [2023-02-16 00:52:36,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 00:52:36,958 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:36,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 101 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 00:52:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-16 00:52:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2023-02-16 00:52:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2023-02-16 00:52:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2023-02-16 00:52:36,982 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 40 [2023-02-16 00:52:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:36,983 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2023-02-16 00:52:36,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 26 states have internal predecessors, (68), 10 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-16 00:52:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2023-02-16 00:52:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 00:52:36,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:36,990 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:37,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:37,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:37,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2084265885, now seen corresponding path program 1 times [2023-02-16 00:52:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:37,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759812807] [2023-02-16 00:52:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:37,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 00:52:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759812807] [2023-02-16 00:52:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759812807] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407876147] [2023-02-16 00:52:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:37,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:37,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:52:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:37,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 00:52:37,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:37,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 00:52:37,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 00:52:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:38,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:38,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-02-16 00:52:38,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:38,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2023-02-16 00:52:38,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:52:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:52:38,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:38,405 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 Int) (v_ArrVal_595 (Array Int Int)) (v_f_~i~1_27 Int)) (or (= (select (store (select (store |c_#memory_int| |c_~#pp~0.base| v_ArrVal_595) |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| (* v_f_~i~1_27 4)) v_ArrVal_596) |c_~#pstate~0.offset|) 1) (< v_f_~i~1_27 1))) is different from false [2023-02-16 00:52:38,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407876147] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:38,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:52:38,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2023-02-16 00:52:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293873567] [2023-02-16 00:52:38,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:38,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 00:52:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:38,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 00:52:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=444, Unknown=7, NotChecked=44, Total=600 [2023-02-16 00:52:38,411 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-16 00:52:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:39,422 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2023-02-16 00:52:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 00:52:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40 [2023-02-16 00:52:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:39,424 INFO L225 Difference]: With dead ends: 141 [2023-02-16 00:52:39,426 INFO L226 Difference]: Without dead ends: 125 [2023-02-16 00:52:39,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=352, Invalid=1175, Unknown=37, NotChecked=76, Total=1640 [2023-02-16 00:52:39,429 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 215 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 47 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:39,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 107 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 481 Invalid, 47 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 00:52:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-16 00:52:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2023-02-16 00:52:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-02-16 00:52:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-02-16 00:52:39,452 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 40 [2023-02-16 00:52:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:39,452 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-02-16 00:52:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 16 states have internal predecessors, (51), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-16 00:52:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-02-16 00:52:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 00:52:39,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:39,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:39,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:39,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:39,657 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -658709463, now seen corresponding path program 1 times [2023-02-16 00:52:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:39,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580808613] [2023-02-16 00:52:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:39,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-16 00:52:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:52:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:39,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580808613] [2023-02-16 00:52:39,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580808613] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:39,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321457615] [2023-02-16 00:52:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:39,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:39,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:39,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:39,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:52:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:39,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:52:39,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 00:52:39,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:52:39,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321457615] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:39,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:39,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-16 00:52:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759593188] [2023-02-16 00:52:39,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:39,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:52:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:52:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:52:39,884 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 00:52:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:40,034 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2023-02-16 00:52:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:52:40,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-02-16 00:52:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:40,036 INFO L225 Difference]: With dead ends: 169 [2023-02-16 00:52:40,036 INFO L226 Difference]: Without dead ends: 105 [2023-02-16 00:52:40,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:52:40,038 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:40,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:52:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-16 00:52:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2023-02-16 00:52:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 77 states have internal predecessors, (94), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-02-16 00:52:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2023-02-16 00:52:40,055 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 41 [2023-02-16 00:52:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:40,055 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2023-02-16 00:52:40,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 00:52:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2023-02-16 00:52:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 00:52:40,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:40,057 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:40,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:40,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:40,266 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash 387918117, now seen corresponding path program 1 times [2023-02-16 00:52:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:40,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68837835] [2023-02-16 00:52:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:40,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68837835] [2023-02-16 00:52:40,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68837835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:40,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31978333] [2023-02-16 00:52:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:40,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:40,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:40,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:40,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 00:52:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:40,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 00:52:40,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:40,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 00:52:41,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:52:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:41,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:41,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-16 00:52:41,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-16 00:52:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31978333] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:41,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:41,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 24 [2023-02-16 00:52:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616797638] [2023-02-16 00:52:41,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:41,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 00:52:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 00:52:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:52:41,205 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 21 states have internal predecessors, (82), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 6 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-16 00:52:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:42,274 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2023-02-16 00:52:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 00:52:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 21 states have internal predecessors, (82), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 6 states have call predecessors, (12), 3 states have call successors, (12) Word has length 43 [2023-02-16 00:52:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:42,276 INFO L225 Difference]: With dead ends: 184 [2023-02-16 00:52:42,276 INFO L226 Difference]: Without dead ends: 158 [2023-02-16 00:52:42,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=458, Invalid=1992, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 00:52:42,278 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 197 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:42,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 147 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:52:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-16 00:52:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 146. [2023-02-16 00:52:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 118 states have internal predecessors, (144), 17 states have call successors, (17), 11 states have call predecessors, (17), 17 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25) [2023-02-16 00:52:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 186 transitions. [2023-02-16 00:52:42,297 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 186 transitions. Word has length 43 [2023-02-16 00:52:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:42,297 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 186 transitions. [2023-02-16 00:52:42,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 21 states have internal predecessors, (82), 6 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (12), 6 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-16 00:52:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2023-02-16 00:52:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 00:52:42,299 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:42,299 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:42,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:42,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:42,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -479191559, now seen corresponding path program 2 times [2023-02-16 00:52:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:42,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337568638] [2023-02-16 00:52:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 00:52:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:52:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337568638] [2023-02-16 00:52:44,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337568638] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034745204] [2023-02-16 00:52:44,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:52:44,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:44,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:44,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:44,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 00:52:44,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:52:44,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:52:44,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 00:52:44,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:44,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-02-16 00:52:44,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:44,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 00:52:44,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2023-02-16 00:52:44,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:44,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 00:52:44,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:44,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 00:52:44,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:44,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-16 00:52:44,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:44,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:52:44,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:44,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:52:44,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 00:52:44,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 00:52:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:52:44,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:45,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:45,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-02-16 00:52:45,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2023-02-16 00:52:45,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:45,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-02-16 00:52:45,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2023-02-16 00:52:45,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 00:52:45,419 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:52:45,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2023-02-16 00:52:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:52:45,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034745204] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:45,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:45,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 11] total 48 [2023-02-16 00:52:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124751801] [2023-02-16 00:52:45,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:45,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-16 00:52:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 00:52:45,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2036, Unknown=22, NotChecked=0, Total=2256 [2023-02-16 00:52:45,478 INFO L87 Difference]: Start difference. First operand 146 states and 186 transitions. Second operand has 48 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 39 states have internal predecessors, (87), 8 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-16 00:52:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:47,128 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2023-02-16 00:52:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 00:52:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 39 states have internal predecessors, (87), 8 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 43 [2023-02-16 00:52:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:47,135 INFO L225 Difference]: With dead ends: 208 [2023-02-16 00:52:47,135 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 00:52:47,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=556, Invalid=3975, Unknown=25, NotChecked=0, Total=4556 [2023-02-16 00:52:47,137 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 183 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:47,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 57 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 00:52:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 00:52:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2023-02-16 00:52:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 85 states have internal predecessors, (105), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-16 00:52:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2023-02-16 00:52:47,158 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 43 [2023-02-16 00:52:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:47,159 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2023-02-16 00:52:47,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 39 states have internal predecessors, (87), 8 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-16 00:52:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2023-02-16 00:52:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 00:52:47,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:47,161 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:47,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:47,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:47,369 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1603970476, now seen corresponding path program 1 times [2023-02-16 00:52:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:47,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538893308] [2023-02-16 00:52:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:52:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538893308] [2023-02-16 00:52:48,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538893308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:48,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407354597] [2023-02-16 00:52:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:48,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:48,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:48,215 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:48,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 00:52:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:48,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-16 00:52:48,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:48,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-02-16 00:52:48,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:48,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:52:48,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 00:52:48,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:48,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 00:52:48,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:48,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:52:48,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 00:52:49,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:52:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:52:49,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:49,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1120 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset| v_ArrVal_1121)) |c_~#pstate~0.base| v_ArrVal_1120) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4))))) is different from false [2023-02-16 00:52:49,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407354597] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:49,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:52:49,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2023-02-16 00:52:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445546390] [2023-02-16 00:52:49,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:49,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 00:52:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:49,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 00:52:49,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1998, Unknown=12, NotChecked=90, Total=2256 [2023-02-16 00:52:49,438 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 31 states have internal predecessors, (70), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 00:52:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:51,821 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2023-02-16 00:52:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-16 00:52:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 31 states have internal predecessors, (70), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2023-02-16 00:52:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:51,822 INFO L225 Difference]: With dead ends: 216 [2023-02-16 00:52:51,823 INFO L226 Difference]: Without dead ends: 138 [2023-02-16 00:52:51,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=737, Invalid=5703, Unknown=44, NotChecked=158, Total=6642 [2023-02-16 00:52:51,825 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 372 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 101 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:51,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 122 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1605 Invalid, 45 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 00:52:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-16 00:52:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-02-16 00:52:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 93 states have internal predecessors, (112), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-16 00:52:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions. [2023-02-16 00:52:51,839 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 45 [2023-02-16 00:52:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:51,839 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 133 transitions. [2023-02-16 00:52:51,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.794871794871795) internal successors, (70), 31 states have internal predecessors, (70), 6 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 00:52:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2023-02-16 00:52:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 00:52:51,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:51,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:51,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:52,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-16 00:52:52,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1534398088, now seen corresponding path program 1 times [2023-02-16 00:52:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:52,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170294422] [2023-02-16 00:52:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:52:52,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:52,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170294422] [2023-02-16 00:52:52,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170294422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:52,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115666987] [2023-02-16 00:52:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:52,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:52,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:52,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 00:52:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:52,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:52:52,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:52:52,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:52:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115666987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:52:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:52:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-02-16 00:52:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651130436] [2023-02-16 00:52:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:52:52,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:52:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:52:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:52:52,334 INFO L87 Difference]: Start difference. First operand 114 states and 133 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:52,358 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2023-02-16 00:52:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:52:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2023-02-16 00:52:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:52,359 INFO L225 Difference]: With dead ends: 197 [2023-02-16 00:52:52,360 INFO L226 Difference]: Without dead ends: 117 [2023-02-16 00:52:52,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:52:52,361 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:52,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 105 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:52:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-16 00:52:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-02-16 00:52:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 95 states have internal predecessors, (109), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 00:52:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-02-16 00:52:52,374 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 48 [2023-02-16 00:52:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:52,375 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-02-16 00:52:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 00:52:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-02-16 00:52:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 00:52:52,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:52,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:52,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:52,583 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1225479932, now seen corresponding path program 1 times [2023-02-16 00:52:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275165977] [2023-02-16 00:52:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-16 00:52:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 00:52:53,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:53,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275165977] [2023-02-16 00:52:53,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275165977] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:53,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294706750] [2023-02-16 00:52:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:53,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:53,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:53,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 00:52:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:53,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-16 00:52:53,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:53,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-02-16 00:52:53,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:53,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:52:53,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 00:52:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 00:52:54,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:54,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-16 00:52:54,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-02-16 00:52:54,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-16 00:52:54,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-16 00:52:54,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:54,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2023-02-16 00:52:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:52:54,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294706750] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:54,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:54,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 52 [2023-02-16 00:52:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719982637] [2023-02-16 00:52:54,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:54,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-16 00:52:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-16 00:52:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2467, Unknown=0, NotChecked=0, Total=2652 [2023-02-16 00:52:54,760 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 38 states have internal predecessors, (109), 12 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2023-02-16 00:52:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:57,159 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2023-02-16 00:52:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-16 00:52:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 38 states have internal predecessors, (109), 12 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) Word has length 53 [2023-02-16 00:52:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:57,161 INFO L225 Difference]: With dead ends: 144 [2023-02-16 00:52:57,161 INFO L226 Difference]: Without dead ends: 108 [2023-02-16 00:52:57,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=899, Invalid=6933, Unknown=0, NotChecked=0, Total=7832 [2023-02-16 00:52:57,163 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 393 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:57,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 140 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 00:52:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-16 00:52:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-16 00:52:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-16 00:52:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-02-16 00:52:57,175 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 53 [2023-02-16 00:52:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:57,175 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-02-16 00:52:57,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 38 states have internal predecessors, (109), 12 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2023-02-16 00:52:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-02-16 00:52:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 00:52:57,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:57,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:52:57,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:57,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-16 00:52:57,382 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2101637850, now seen corresponding path program 2 times [2023-02-16 00:52:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:57,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316747817] [2023-02-16 00:52:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:52:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:52:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:52:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:52:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-16 00:52:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:52:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:58,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316747817] [2023-02-16 00:52:58,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316747817] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:58,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792921767] [2023-02-16 00:52:58,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:52:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:58,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:58,425 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:52:58,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 00:52:58,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:52:58,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:52:58,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-16 00:52:58,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:59,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:59,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:52:59,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-16 00:52:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 00:52:59,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:59,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-16 00:52:59,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-16 00:52:59,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:59,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-16 00:52:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 00:52:59,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792921767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:59,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:59,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 52 [2023-02-16 00:52:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471653503] [2023-02-16 00:52:59,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:59,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-16 00:52:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-16 00:52:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2469, Unknown=0, NotChecked=0, Total=2652 [2023-02-16 00:52:59,888 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 52 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 36 states have internal predecessors, (101), 12 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-16 00:53:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:53:01,261 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2023-02-16 00:53:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 00:53:01,261 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 36 states have internal predecessors, (101), 12 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 53 [2023-02-16 00:53:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:53:01,262 INFO L225 Difference]: With dead ends: 98 [2023-02-16 00:53:01,262 INFO L226 Difference]: Without dead ends: 70 [2023-02-16 00:53:01,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=477, Invalid=4493, Unknown=0, NotChecked=0, Total=4970 [2023-02-16 00:53:01,263 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 160 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:53:01,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 122 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 00:53:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-16 00:53:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2023-02-16 00:53:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:53:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2023-02-16 00:53:01,272 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2023-02-16 00:53:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:53:01,272 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2023-02-16 00:53:01,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 36 states have internal predecessors, (101), 12 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-16 00:53:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2023-02-16 00:53:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 00:53:01,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:53:01,273 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:53:01,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 00:53:01,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-16 00:53:01,479 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:53:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:53:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -699436896, now seen corresponding path program 1 times [2023-02-16 00:53:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:53:01,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995831030] [2023-02-16 00:53:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:53:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:53:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-16 00:53:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 00:53:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-16 00:53:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-16 00:53:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 00:53:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:53:02,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:53:02,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995831030] [2023-02-16 00:53:02,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995831030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:53:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536821024] [2023-02-16 00:53:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:53:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:53:02,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:53:02,385 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:53:02,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 00:53:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:02,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-16 00:53:02,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:53:02,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-02-16 00:53:02,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:02,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:53:02,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 00:53:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:03,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 00:53:03,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:03,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:53:03,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 00:53:03,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-16 00:53:03,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:53:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 00:53:03,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:53:03,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1785 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset| v_ArrVal_1785)) |c_~#pstate~0.base| v_ArrVal_1786) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2023-02-16 00:53:03,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536821024] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:53:03,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:53:03,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-02-16 00:53:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11945444] [2023-02-16 00:53:03,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:53:03,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 00:53:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:53:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 00:53:03,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2017, Unknown=13, NotChecked=90, Total=2256 [2023-02-16 00:53:03,717 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 41 states, 40 states have (on average 2.1) internal successors, (84), 33 states have internal predecessors, (84), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 00:53:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:53:04,913 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2023-02-16 00:53:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 00:53:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 33 states have internal predecessors, (84), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 56 [2023-02-16 00:53:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:53:04,914 INFO L225 Difference]: With dead ends: 59 [2023-02-16 00:53:04,914 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 00:53:04,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=321, Invalid=3688, Unknown=27, NotChecked=124, Total=4160 [2023-02-16 00:53:04,916 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 45 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:53:04,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 59 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 629 Invalid, 17 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:53:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 00:53:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 00:53:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:53:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 00:53:04,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2023-02-16 00:53:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:53:04,917 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 00:53:04,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 33 states have internal predecessors, (84), 7 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-16 00:53:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 00:53:04,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 00:53:04,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:53:04,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 00:53:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 00:53:05,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 00:53:06,607 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2023-02-16 00:53:06,607 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 33) no Hoare annotation was computed. [2023-02-16 00:53:06,607 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse12 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= f_~pointer.base |f_#in~pointer.base|)) (.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse14 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= (select .cse13 .cse14) 0))) (.cse5 (and .cse2 .cse1 (= f_~i~1 0) .cse3 (= |f_#in~pointer.offset| f_~pointer.offset) .cse4)) (.cse6 (not (= (select .cse12 .cse14) 0))) (.cse8 (not (= |~#pstate~0.offset| 0))) (.cse9 (not (<= 5 |~#pstate~0.base|))) (.cse7 (select .cse13 |~#pp~0.offset|)) (.cse10 (not (= |~#pp~0.offset| 0))) (.cse11 (not (<= |~#pp~0.base| 4)))) (and (or .cse0 (and .cse1 .cse2 (= f_~pointer.offset |f_#in~pointer.offset|) (<= 1 f_~i~1) .cse3 (<= f_~i~1 1) .cse4) .cse5 .cse6 (not (= .cse7 1)) .cse8 .cse9 .cse10 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|) 1)) .cse11) (or (not (= (select .cse12 |~#pp~0.offset|) 0)) .cse0 .cse5 .cse6 .cse8 .cse9 (not (= .cse7 0)) .cse10 .cse11)))) [2023-02-16 00:53:06,608 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 25 34) no Hoare annotation was computed. [2023-02-16 00:53:06,608 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 34) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse9 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse10 (+ |~#pp~0.offset| 4))) (let ((.cse1 (not (= (select .cse9 .cse10) 0))) (.cse2 (not (= (select .cse0 .cse10) 0))) (.cse3 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse6 (select .cse9 |~#pp~0.offset|)) (.cse4 (not (= |~#pstate~0.offset| 0))) (.cse5 (not (<= 5 |~#pstate~0.base|))) (.cse7 (not (= |~#pp~0.offset| 0))) (.cse8 (not (<= |~#pp~0.base| 4)))) (and (or (not (= (select .cse0 |~#pp~0.offset|) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= .cse6 0)) .cse7 .cse8) (or .cse1 .cse2 .cse3 (not (= .cse6 1)) .cse4 .cse5 .cse7 (not (= (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|) 1)) .cse8)))) [2023-02-16 00:53:06,608 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 25 34) no Hoare annotation was computed. [2023-02-16 00:53:06,608 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 36 45) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= (select .cse5 (+ |~#pp~0.offset| 4)) 1))) (.cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse2 (not (= |~#pstate~0.offset| 0))) (.cse3 (not (<= 5 |~#pstate~0.base|))) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse6 (not (<= |~#pp~0.base| 4)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (select .cse5 |~#pstate~0.offset|) 1)) .cse6) (or .cse0 (not (= (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) 0) 1)) (not (= |g_#in~pointer#1.offset| 2)) .cse1 .cse2 .cse3 .cse4 .cse6)))) [2023-02-16 00:53:06,608 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2023-02-16 00:53:06,608 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse18 (select .cse2 |~#pp~0.offset|)) (.cse20 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse16 (+ |~#pp~0.offset| 4))) (let ((.cse22 (select .cse2 .cse16)) (.cse30 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse29 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse31 (select .cse20 |~#pp~0.offset|)) (.cse32 (= .cse18 0))) (let ((.cse15 (select |#memory_int| |~#pstate~0.base|)) (.cse21 (* |g_~i~2#1| 4)) (.cse17 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse23 (or (not (= 0 .cse31)) .cse32)) (.cse27 (<= 5 |~#pstate~0.base|)) (.cse24 (let ((.cse33 (select .cse29 0)) (.cse34 (select .cse30 0))) (or (= .cse33 .cse34) (and (= 0 .cse33) (= .cse34 |f_#in~pointer.base|))))) (.cse25 (or (= |~#pstate~0.base| |~#pp~0.base|) (= .cse22 (select .cse20 .cse16)))) (.cse14 (<= 2 |g_~i~2#1|)) (.cse28 (= |~#pstate~0.offset| 0)) (.cse26 (or (not (= (select .cse29 |~#pp~0.offset|) 0)) (and (= (select .cse30 |~#pp~0.offset|) 0) (= .cse31 0)) (not .cse32)))) (let ((.cse7 (= |g_~pointer#1.offset| |g_#in~pointer#1.offset|)) (.cse0 (and .cse23 (<= |~#pp~0.offset| 0) .cse27 .cse24 .cse25 .cse14 .cse28 (<= 0 |~#pp~0.offset|) .cse26)) (.cse1 (not (= (select .cse17 .cse16) 1))) (.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse8 (= |g_~i~2#1| 0)) (.cse9 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (not .cse28)) (.cse4 (not .cse27)) (.cse10 (not (= |~#pp~0.offset| 0))) (.cse11 (not (<= |~#pp~0.base| 4))) (.cse12 (and .cse23 .cse24 .cse25 (= (select .cse15 (+ |~#pstate~0.offset| .cse21)) 1) .cse26 (<= 1 |g_~i~2#1|)))) (and (or .cse0 .cse1 (not (= (select .cse2 0) 1)) (not (= |g_#in~pointer#1.offset| 2)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12) (let ((.cse13 (= .cse2 .cse20)) (.cse19 (= .cse22 |g_#in~pointer#1.offset|))) (or .cse1 (and .cse7 .cse8) (and .cse13 .cse14 (= (select .cse15 .cse16) 1)) (not (= (select .cse17 0) 1)) (not (= |g_#in~pointer#1.offset| .cse18)) .cse3 .cse4 (and .cse19 .cse14) .cse10 .cse11 (and .cse13 (or .cse19 (not (= (select .cse20 (+ .cse21 |~#pp~0.offset|)) |g_~pointer#1.offset|))) (= .cse16 (+ |~#pstate~0.offset| (* 4 |g_~i~2#1|)))))) (or .cse0 .cse1 (and .cse5 .cse6 .cse8 .cse9) .cse3 .cse4 .cse10 (not (= (select .cse17 |~#pstate~0.offset|) 1)) .cse11 .cse12))))))) [2023-02-16 00:53:06,608 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 36 45) no Hoare annotation was computed. [2023-02-16 00:53:06,608 INFO L899 garLoopResultBuilder]: For program point gErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-02-16 00:53:06,608 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point gEXIT(lines 36 45) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 9) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#pstate~0.base|)) (.cse7 (+ |~#pp~0.offset| 4))) (let ((.cse0 (= |~#pp~0.offset| 0)) (.cse2 (<= |~#pp~0.base| 4)) (.cse3 (<= 5 |~#pstate~0.base|)) (.cse4 (= |~#pstate~0.offset| 0)) (.cse5 (= (select .cse1 .cse7) 1))) (or (and .cse0 (= (select .cse1 |~#pstate~0.offset|) 1) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_main_~a~0#1.offset| 1)) (let ((.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) .cse0 (<= 2 ~counter~0) .cse2 .cse3 (not (= (select .cse6 .cse7) |ULTIMATE.start_main_~a~0#1.offset|)) .cse4 .cse5 (= (select .cse6 0) 1) (= (+ (select .cse6 |~#pp~0.offset|) 1) |ULTIMATE.start_main_~b~0#1.offset|)))))) [2023-02-16 00:53:06,609 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (+ |~#pp~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 |~#pp~0.offset|) 0) (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= 5 |~#pstate~0.base|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_main_~b~0#1.offset| 2) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= (select .cse0 .cse2) 0) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= |ULTIMATE.start_main_~b~0#1.base| 0) (<= |~#pp~0.base| 4) (= |~#pstate~0.offset| 0) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= (select .cse1 |~#pp~0.offset|) 0))) [2023-02-16 00:53:06,609 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= 5 |~#pstate~0.base|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1) 0) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (<= |~#pp~0.base| 4) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= (select .cse0 0) 1) (= 0 |~#pstate~0.offset|) (= (+ (select .cse0 |~#pp~0.offset|) 1) |ULTIMATE.start_main_~b~0#1.offset|))) [2023-02-16 00:53:06,609 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (+ |~#pp~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 |~#pp~0.offset|) 0) (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= 5 |~#pstate~0.base|) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_main_~a~0#1.offset| 1) (= |ULTIMATE.start_main_~a~0#1.base| 0) (= ~counter~0 2) (= (select .cse0 .cse2) 0) (= |~#pp~0.offset| 0) (<= |~#pp~0.base| 4) (= |~#pstate~0.offset| 0) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= (select .cse1 |~#pp~0.offset|) 0))) [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2023-02-16 00:53:06,609 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-02-16 00:53:06,610 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse7 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse11 (+ |~#pp~0.offset| 4))) (let ((.cse0 (select .cse7 .cse11)) (.cse1 (= ~counter~0 1)) (.cse2 (<= |~#pp~0.offset| 0)) (.cse3 (<= |~#pp~0.base| 4)) (.cse4 (<= 5 |~#pstate~0.base|)) (.cse5 (= |~#pstate~0.offset| 0)) (.cse6 (<= 0 |~#pp~0.offset|)) (.cse9 (= (select .cse10 .cse11) 0))) (or (let ((.cse8 (+ |~#pp~0.offset| (* |ULTIMATE.start_init_~i~0#1| 4)))) (and (= |ULTIMATE.start_init_~i~0#1| 0) (= 0 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse7 .cse8) 0) .cse9 (= (select .cse10 .cse8) 0))) (and (= .cse0 0) (= (select .cse7 |~#pp~0.offset|) 0) .cse1 .cse2 (<= 1 |ULTIMATE.start_init_~i~0#1|) .cse3 .cse4 .cse5 .cse6 (= (select .cse10 |~#pp~0.offset|) 0) .cse9)))) [2023-02-16 00:53:06,610 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 00:53:06,610 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 53 71) the Hoare annotation is: true [2023-02-16 00:53:06,610 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 00:53:06,610 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#pstate~0.base|)) (.cse2 (+ |~#pp~0.offset| 4)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |ULTIMATE.start_main_~b~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| 1)) (= |~#pp~0.offset| 0) (<= 2 ~counter~0) (= (select .cse0 |~#pstate~0.offset|) 1) (= (select .cse1 .cse2) 2) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= (select .cse0 .cse2) 1) (= (select .cse1 0) 1) (= 0 |~#pstate~0.offset|) (= (+ (select .cse1 |~#pp~0.offset|) 1) |ULTIMATE.start_main_~b~0#1.offset|))) [2023-02-16 00:53:06,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 00:53:06,612 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 60) no Hoare annotation was computed. [2023-02-16 00:53:06,612 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |~#pp~0.offset|) 0) (= |~#pp~0.offset| 0) (= ~counter~0 1) (<= 1 |ULTIMATE.start_init_~i~0#1|) (<= |~#pp~0.base| 4) (<= 5 |~#pstate~0.base|) (= |~#pstate~0.offset| 0) (not (= 4 (* 4 |ULTIMATE.start_init_~i~0#1|))) (= (select .cse2 .cse1) 0) (= (select .cse2 |~#pp~0.offset|) 0))) [2023-02-16 00:53:06,612 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2023-02-16 00:53:06,612 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-02-16 00:53:06,612 INFO L899 garLoopResultBuilder]: For program point fake_mallocFINAL(lines 48 51) no Hoare annotation was computed. [2023-02-16 00:53:06,612 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 48 51) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= (select .cse10 .cse9) 0))) (.cse1 (not (= (select .cse10 |~#pp~0.offset|) 0))) (.cse2 (not (= |~#pstate~0.offset| 0))) (.cse3 (not (<= 5 |~#pstate~0.base|))) (.cse4 (not (= |~#pp~0.offset| 0))) (.cse5 (not (= (select .cse8 .cse9) 0))) (.cse6 (not (= (select .cse8 |~#pp~0.offset|) 0))) (.cse7 (not (<= |~#pp~0.base| 4)))) (and (or (not (= |old(~counter~0)| 1)) .cse0 (= ~counter~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (= ~counter~0 2) (not (= |old(~counter~0)| 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2023-02-16 00:53:06,612 INFO L899 garLoopResultBuilder]: For program point fake_mallocEXIT(lines 48 51) no Hoare annotation was computed. [2023-02-16 00:53:06,616 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:53:06,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:53:06,629 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,630 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,630 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,631 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,631 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,632 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,632 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,639 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,640 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,642 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,642 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,642 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,642 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,642 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,643 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,644 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,644 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,645 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,645 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,650 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,650 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,650 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,651 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,651 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,651 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,651 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,651 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,652 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,652 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,652 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,653 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,654 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,655 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,655 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,656 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,656 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,656 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,656 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,657 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,657 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,657 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,658 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,658 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,659 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,660 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,660 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,660 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,661 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,664 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,665 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,665 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,665 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,665 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,665 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,690 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,690 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,691 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,691 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,691 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,691 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,691 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,692 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,693 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,694 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,696 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,696 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,696 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,696 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,697 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,698 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,701 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,701 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,701 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,701 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,705 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,705 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,705 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,705 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,706 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,706 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,706 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,706 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,707 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,716 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,722 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,722 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,722 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,722 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,723 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,724 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,724 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,724 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,724 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,724 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,725 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,725 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,725 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,726 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,726 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,726 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,726 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,727 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,727 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,727 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,727 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,727 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,727 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,728 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,728 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,728 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,728 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,728 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,729 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,729 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,729 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,729 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,731 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,731 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,731 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,731 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,731 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,732 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,732 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,732 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,732 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,733 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,733 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,733 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,733 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,733 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,734 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,734 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:53:06 BoogieIcfgContainer [2023-02-16 00:53:06,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:53:06,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:53:06,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:53:06,736 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:53:06,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:52:30" (3/4) ... [2023-02-16 00:53:06,739 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 00:53:06,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2023-02-16 00:53:06,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2023-02-16 00:53:06,744 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2023-02-16 00:53:06,749 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-16 00:53:06,749 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-16 00:53:06,750 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 00:53:06,750 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 00:53:06,772 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(\old(#memory_$Pointer$)[pp][pp + 4] == 0) || ((((((\old(#memory_$Pointer$) == #memory_$Pointer$ && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && pointer == pointer) && 1 <= i) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i <= 1) && pointer == pointer)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 1)) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) && ((((((((!(\old(#memory_$Pointer$)[pp][pp] == 0) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(pstate == 0)) || !(5 <= pstate)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)) || !(pp == 0)) || !(pp <= 4)) [2023-02-16 00:53:06,772 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp <= 0) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && 2 <= i) && pstate == 0) && 0 <= pp) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) || !(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1)) || !(\old(#memory_$Pointer$)[pp][0] == 1)) || !(pointer == 2)) || !(pstate == 0)) || !(5 <= pstate)) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(pp == 0)) || !(pp <= 4)) || ((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) && 1 <= i)) && ((((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || (pointer == pointer && i == 0)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && 2 <= i) && unknown-#memory_int-unknown[pstate][pp + 4] == 1)) || !(\old(unknown-#memory_int-unknown)[pstate][0] == 1)) || !(pointer == \old(#memory_$Pointer$)[pp][pp])) || !(pstate == 0)) || !(5 <= pstate)) || (\old(#memory_$Pointer$)[pp][pp + 4] == pointer && 2 <= i)) || !(pp == 0)) || !(pp <= 4)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && (\old(#memory_$Pointer$)[pp][pp + 4] == pointer || !(#memory_$Pointer$[pp][i * 4 + pp] == pointer))) && pp + 4 == pstate + 4 * i))) && (((((((((((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp <= 0) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && 2 <= i) && pstate == 0) && 0 <= pp) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) || !(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) || ((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) && 1 <= i)) [2023-02-16 00:53:06,790 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 00:53:06,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:53:06,792 INFO L158 Benchmark]: Toolchain (without parser) took 36414.68ms. Allocated memory was 157.3MB in the beginning and 312.5MB in the end (delta: 155.2MB). Free memory was 109.0MB in the beginning and 261.4MB in the end (delta: -152.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,792 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:53:06,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.99ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 98.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.36ms. Allocated memory is still 157.3MB. Free memory was 98.5MB in the beginning and 96.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,793 INFO L158 Benchmark]: Boogie Preprocessor took 34.36ms. Allocated memory is still 157.3MB. Free memory was 96.6MB in the beginning and 95.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,793 INFO L158 Benchmark]: RCFGBuilder took 319.71ms. Allocated memory is still 157.3MB. Free memory was 95.2MB in the beginning and 82.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,793 INFO L158 Benchmark]: TraceAbstraction took 35766.87ms. Allocated memory was 157.3MB in the beginning and 312.5MB in the end (delta: 155.2MB). Free memory was 126.7MB in the beginning and 264.5MB in the end (delta: -137.9MB). Peak memory consumption was 186.4MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,794 INFO L158 Benchmark]: Witness Printer took 55.23ms. Allocated memory is still 312.5MB. Free memory was 264.5MB in the beginning and 261.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:53:06,799 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.17ms. Allocated memory is still 107.0MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.99ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 98.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.36ms. Allocated memory is still 157.3MB. Free memory was 98.5MB in the beginning and 96.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.36ms. Allocated memory is still 157.3MB. Free memory was 96.6MB in the beginning and 95.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.71ms. Allocated memory is still 157.3MB. Free memory was 95.2MB in the beginning and 82.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35766.87ms. Allocated memory was 157.3MB in the beginning and 312.5MB in the end (delta: 155.2MB). Free memory was 126.7MB in the beginning and 264.5MB in the end (delta: -137.9MB). Peak memory consumption was 186.4MB. Max. memory is 16.1GB. * Witness Printer took 55.23ms. Allocated memory is still 312.5MB. Free memory was 264.5MB in the beginning and 261.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 109 mSolverCounterUnknown, 2280 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2253 mSDsluCounter, 1310 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1010 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8943 IncrementalHoareTripleChecker+Invalid, 9639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 300 mSDtfsCounter, 8943 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 826 SyntacticMatches, 12 SemanticMatches, 557 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7162 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=9, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 178 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 136 PreInvPairs, 174 NumberOfFragments, 1708 HoareAnnotationTreeSize, 136 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 4757 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1433 ConstructedInterpolants, 8 QuantifiedInterpolants, 11354 SizeOfPredicates, 92 NumberOfNonLiveVariables, 3732 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 391/660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2023-02-16 00:53:06,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,814 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,815 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,816 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,817 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,818 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,819 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,820 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,821 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,822 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,824 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,824 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,826 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,826 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,827 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,828 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,829 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,830 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,831 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,832 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,833 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,834 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,835 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,836 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp <= 0) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && 2 <= i) && pstate == 0) && 0 <= pp) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) || !(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1)) || !(\old(#memory_$Pointer$)[pp][0] == 1)) || !(pointer == 2)) || !(pstate == 0)) || !(5 <= pstate)) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(pp == 0)) || !(pp <= 4)) || ((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) && 1 <= i)) && ((((((((((!(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1) || (pointer == pointer && i == 0)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && 2 <= i) && unknown-#memory_int-unknown[pstate][pp + 4] == 1)) || !(\old(unknown-#memory_int-unknown)[pstate][0] == 1)) || !(pointer == \old(#memory_$Pointer$)[pp][pp])) || !(pstate == 0)) || !(5 <= pstate)) || (\old(#memory_$Pointer$)[pp][pp + 4] == pointer && 2 <= i)) || !(pp == 0)) || !(pp <= 4)) || ((\old(#memory_$Pointer$)[pp] == #memory_$Pointer$[pp] && (\old(#memory_$Pointer$)[pp][pp + 4] == pointer || !(#memory_$Pointer$[pp][i * 4 + pp] == pointer))) && pp + 4 == pstate + 4 * i))) && (((((((((((((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && pp <= 0) && 5 <= pstate) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && 2 <= i) && pstate == 0) && 0 <= pp) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) || !(\old(unknown-#memory_int-unknown)[pstate][pp + 4] == 1)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) || ((((((!(0 == #memory_$Pointer$[pp][pp]) || \old(#memory_$Pointer$)[pp][pp] == 0) && (\old(#memory_$Pointer$)[pp][0] == #memory_$Pointer$[pp][0] || (0 == \old(#memory_$Pointer$)[pp][0] && #memory_$Pointer$[pp][0] == pointer))) && (pstate == pp || \old(#memory_$Pointer$)[pp][pp + 4] == #memory_$Pointer$[pp][pp + 4])) && unknown-#memory_int-unknown[pstate][pstate + i * 4] == 1) && ((!(\old(#memory_$Pointer$)[pp][pp] == 0) || (#memory_$Pointer$[pp][pp] == 0 && #memory_$Pointer$[pp][pp] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 0))) && 1 <= i)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant [2023-02-16 00:53:06,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,838 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,840 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,841 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,842 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,843 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((!(\old(#memory_$Pointer$)[pp][pp + 4] == 0) || ((((((\old(#memory_$Pointer$) == #memory_$Pointer$ && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && pointer == pointer) && 1 <= i) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && i <= 1) && pointer == pointer)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(\old(#memory_$Pointer$)[pp][pp] == 1)) || !(pstate == 0)) || !(5 <= pstate)) || !(pp == 0)) || !(\old(unknown-#memory_int-unknown)[pstate][pstate] == 1)) || !(pp <= 4)) && ((((((((!(\old(#memory_$Pointer$)[pp][pp] == 0) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && pointer == pointer)) || !(\old(#memory_$Pointer$)[pp][pp + 4] == 0)) || !(pstate == 0)) || !(5 <= pstate)) || !(\old(#memory_$Pointer$)[pp][pp] == 0)) || !(pp == 0)) || !(pp <= 4)) - InvariantResult [Line: 19]: Loop Invariant [2023-02-16 00:53:06,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,844 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,845 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-02-16 00:53:06,846 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((i == 0 && 0 == #memory_$Pointer$[pp][pp + 4]) && counter == 1) && pp <= 0) && pp <= 4) && 5 <= pstate) && pstate == 0) && 0 <= pp) && #memory_$Pointer$[pp][pp + i * 4] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && #memory_$Pointer$[pp][pp + i * 4] == 0) || ((((((((((#memory_$Pointer$[pp][pp + 4] == 0 && #memory_$Pointer$[pp][pp] == 0) && counter == 1) && pp <= 0) && 1 <= i) && pp <= 4) && 5 <= pstate) && pstate == 0) && 0 <= pp) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) RESULT: Ultimate proved your program to be correct! [2023-02-16 00:53:06,864 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