./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/list-simple/sll2n_update_all.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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:58:23,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:58:23,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:58:23,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:58:23,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:58:23,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:58:23,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:58:23,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:58:23,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:58:23,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:58:23,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:58:23,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:58:23,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:58:23,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:58:23,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:58:23,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:58:23,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:58:23,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:58:23,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:58:23,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:58:23,697 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:58:23,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:58:23,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:58:23,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:58:23,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:58:23,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:58:23,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:58:23,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:58:23,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:58:23,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:58:23,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:58:23,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:58:23,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:58:23,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:58:23,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:58:23,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:58:23,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:58:23,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:58:23,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:58:23,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:58:23,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:58:23,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:58:23,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:58:23,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:58:23,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:58:23,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:58:23,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:58:23,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:58:23,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:58:23,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:58:23,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:58:23,739 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:58:23,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:58:23,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:58:23,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:58:23,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:58:23,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:58:23,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:58:23,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:58:23,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:58:23,741 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:58:23,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:58:23,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:58:23,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:58:23,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:58:23,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:58:23,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:58:23,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:58:23,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:58:23,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:58:23,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:58:23,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:58:23,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:58:23,744 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:58:23,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:58:23,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:58:23,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-07-22 14:58:23,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:58:23,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:58:23,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:58:23,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:58:23,969 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:58:23,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-07-22 14:58:24,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7304a4308/975e020347a647119ec364a7b83bb544/FLAG34bc33f69 [2022-07-22 14:58:24,437 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:58:24,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-07-22 14:58:24,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7304a4308/975e020347a647119ec364a7b83bb544/FLAG34bc33f69 [2022-07-22 14:58:24,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7304a4308/975e020347a647119ec364a7b83bb544 [2022-07-22 14:58:24,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:58:24,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:58:24,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:58:24,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:58:24,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:58:24,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fea63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24, skipping insertion in model container [2022-07-22 14:58:24,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:58:24,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:58:24,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-07-22 14:58:24,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:58:24,763 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:58:24,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i[24218,24231] [2022-07-22 14:58:24,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:58:24,810 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:58:24,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24 WrapperNode [2022-07-22 14:58:24,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:58:24,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:58:24,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:58:24,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:58:24,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,860 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-07-22 14:58:24,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:58:24,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:58:24,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:58:24,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:58:24,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:58:24,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:58:24,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:58:24,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:58:24,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (1/1) ... [2022-07-22 14:58:24,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:58:24,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:24,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:58:24,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:58:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:58:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:58:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:58:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:58:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:58:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:58:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:58:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:58:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:58:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:58:25,030 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:58:25,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:58:25,150 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:58:25,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:58:25,155 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 14:58:25,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:58:25 BoogieIcfgContainer [2022-07-22 14:58:25,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:58:25,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:58:25,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:58:25,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:58:25,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:58:24" (1/3) ... [2022-07-22 14:58:25,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580ecacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:58:25, skipping insertion in model container [2022-07-22 14:58:25,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:24" (2/3) ... [2022-07-22 14:58:25,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580ecacd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:58:25, skipping insertion in model container [2022-07-22 14:58:25,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:58:25" (3/3) ... [2022-07-22 14:58:25,162 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-07-22 14:58:25,171 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:58:25,171 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:58:25,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:58:25,204 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41a1638a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d723267 [2022-07-22 14:58:25,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:58:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 14:58:25,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:25,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:25,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -204150994, now seen corresponding path program 1 times [2022-07-22 14:58:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129546721] [2022-07-22 14:58:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:25,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:25,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129546721] [2022-07-22 14:58:25,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129546721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:58:25,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:58:25,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:58:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061480142] [2022-07-22 14:58:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:58:25,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:58:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:58:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:58:25,352 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:25,363 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-07-22 14:58:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:58:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2022-07-22 14:58:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:25,369 INFO L225 Difference]: With dead ends: 52 [2022-07-22 14:58:25,370 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 14:58:25,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:58:25,376 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:25,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 14:58:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-22 14:58:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 14:58:25,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-22 14:58:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:25,402 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 14:58:25,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 14:58:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 14:58:25,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:25,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:25,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:58:25,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1517700322, now seen corresponding path program 1 times [2022-07-22 14:58:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:25,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206201424] [2022-07-22 14:58:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:25,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:25,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:25,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206201424] [2022-07-22 14:58:25,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206201424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:58:25,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:58:25,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:58:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240246504] [2022-07-22 14:58:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:58:25,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:58:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:58:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:58:25,500 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:25,522 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-07-22 14:58:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:58:25,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2022-07-22 14:58:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:25,523 INFO L225 Difference]: With dead ends: 44 [2022-07-22 14:58:25,523 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 14:58:25,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:58:25,525 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:25,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 14:58:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-22 14:58:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 14:58:25,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2022-07-22 14:58:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:25,533 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 14:58:25,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 14:58:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 14:58:25,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:25,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:25,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:58:25,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1110902602, now seen corresponding path program 1 times [2022-07-22 14:58:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322678510] [2022-07-22 14:58:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322678510] [2022-07-22 14:58:25,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322678510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:25,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762420624] [2022-07-22 14:58:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:25,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:25,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:25,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:58:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:25,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:58:25,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:25,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:25,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762420624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:25,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:25,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-22 14:58:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351381920] [2022-07-22 14:58:25,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:58:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:58:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:58:25,777 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:25,790 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-22 14:58:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:58:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 18 [2022-07-22 14:58:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:25,791 INFO L225 Difference]: With dead ends: 45 [2022-07-22 14:58:25,791 INFO L226 Difference]: Without dead ends: 29 [2022-07-22 14:58:25,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:58:25,792 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:25,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-22 14:58:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-22 14:58:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-22 14:58:25,796 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-07-22 14:58:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:25,796 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-22 14:58:25,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-22 14:58:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 14:58:25,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:25,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:25,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:26,016 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 [2022-07-22 14:58:26,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash 266893854, now seen corresponding path program 2 times [2022-07-22 14:58:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:26,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622339813] [2022-07-22 14:58:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622339813] [2022-07-22 14:58:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622339813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:58:26,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:58:26,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:58:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369741132] [2022-07-22 14:58:26,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:58:26,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:58:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:58:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:58:26,108 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:26,128 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-07-22 14:58:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:58:26,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 23 [2022-07-22 14:58:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:26,130 INFO L225 Difference]: With dead ends: 51 [2022-07-22 14:58:26,130 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:58:26,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:58:26,131 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:26,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:58:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-07-22 14:58:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-22 14:58:26,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-07-22 14:58:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:26,135 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-22 14:58:26,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-22 14:58:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:58:26,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:26,136 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] [2022-07-22 14:58:26,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:58:26,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1444962716, now seen corresponding path program 1 times [2022-07-22 14:58:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:26,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244962175] [2022-07-22 14:58:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:26,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244962175] [2022-07-22 14:58:26,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244962175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:26,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196460223] [2022-07-22 14:58:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:26,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:26,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:26,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:26,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:58:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:26,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 14:58:26,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196460223] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:26,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:26,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-22 14:58:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296533853] [2022-07-22 14:58:26,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:26,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 14:58:26,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:26,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 14:58:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:58:26,425 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:26,449 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-22 14:58:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:58:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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) Word has length 28 [2022-07-22 14:58:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:26,450 INFO L225 Difference]: With dead ends: 53 [2022-07-22 14:58:26,450 INFO L226 Difference]: Without dead ends: 44 [2022-07-22 14:58:26,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:58:26,451 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:26,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 74 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-22 14:58:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2022-07-22 14:58:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-22 14:58:26,455 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 28 [2022-07-22 14:58:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:26,456 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-22 14:58:26,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-22 14:58:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-22 14:58:26,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:26,457 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] [2022-07-22 14:58:26,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:26,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:26,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1623423198, now seen corresponding path program 2 times [2022-07-22 14:58:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640597980] [2022-07-22 14:58:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:26,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640597980] [2022-07-22 14:58:26,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640597980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:26,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924825599] [2022-07-22 14:58:26,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:58:26,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:26,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:26,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:26,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 [2022-07-22 14:58:26,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:58:26,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:58:26,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:58:26,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:26,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924825599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:26,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:26,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-22 14:58:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377992509] [2022-07-22 14:58:26,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:26,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:58:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:58:26,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:58:26,852 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:26,876 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-07-22 14:58:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:58:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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) Word has length 33 [2022-07-22 14:58:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:26,877 INFO L225 Difference]: With dead ends: 58 [2022-07-22 14:58:26,877 INFO L226 Difference]: Without dead ends: 44 [2022-07-22 14:58:26,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:58:26,878 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:26,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 98 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-22 14:58:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-07-22 14:58:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-22 14:58:26,895 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2022-07-22 14:58:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:26,895 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-22 14:58:26,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-22 14:58:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:58:26,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:26,896 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] [2022-07-22 14:58:26,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:27,121 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 [2022-07-22 14:58:27,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1284207405, now seen corresponding path program 1 times [2022-07-22 14:58:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:27,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550889270] [2022-07-22 14:58:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:27,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550889270] [2022-07-22 14:58:27,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550889270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:27,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336890280] [2022-07-22 14:58:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:27,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:27,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:27,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:27,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:58:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:27,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-22 14:58:27,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:27,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:58:27,679 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:58:27,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:58:27,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:58:27,911 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-22 14:58:27,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-07-22 14:58:27,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:58:27,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:58:28,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:58:28,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:58:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:28,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:28,273 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_356 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-22 14:58:28,289 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_356) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_356 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_356) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-22 14:58:28,297 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_356) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_356 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_356) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-22 14:58:28,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:58:28,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-22 14:58:28,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:58:28,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2022-07-22 14:58:28,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-07-22 14:58:28,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:58:28,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-22 14:58:28,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-22 14:58:28,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-07-22 14:58:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-22 14:58:28,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336890280] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:28,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:28,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 19] total 51 [2022-07-22 14:58:28,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251521705] [2022-07-22 14:58:28,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:28,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 14:58:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 14:58:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2102, Unknown=3, NotChecked=282, Total=2550 [2022-07-22 14:58:28,612 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 51 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:29,597 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-07-22 14:58:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 14:58:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 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) Word has length 34 [2022-07-22 14:58:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:29,598 INFO L225 Difference]: With dead ends: 75 [2022-07-22 14:58:29,598 INFO L226 Difference]: Without dead ends: 73 [2022-07-22 14:58:29,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=500, Invalid=3799, Unknown=3, NotChecked=390, Total=4692 [2022-07-22 14:58:29,600 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 210 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:29,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 342 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 594 Invalid, 0 Unknown, 185 Unchecked, 0.3s Time] [2022-07-22 14:58:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-22 14:58:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-07-22 14:58:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-07-22 14:58:29,606 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 34 [2022-07-22 14:58:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:29,606 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-22 14:58:29,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-07-22 14:58:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 14:58:29,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:29,607 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] [2022-07-22 14:58:29,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:29,826 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 [2022-07-22 14:58:29,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1207377995, now seen corresponding path program 1 times [2022-07-22 14:58:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:29,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952506156] [2022-07-22 14:58:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 14:58:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952506156] [2022-07-22 14:58:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952506156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:58:29,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:58:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:58:29,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312674455] [2022-07-22 14:58:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:58:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:58:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:58:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:58:29,872 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:29,890 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-22 14:58:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:58:29,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 35 [2022-07-22 14:58:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:29,893 INFO L225 Difference]: With dead ends: 70 [2022-07-22 14:58:29,893 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 14:58:29,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:58:29,894 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:29,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 14:58:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-22 14:58:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-22 14:58:29,912 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 35 [2022-07-22 14:58:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:29,913 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-22 14:58:29,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-22 14:58:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 14:58:29,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:29,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:29,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 14:58:29,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:29,918 INFO L85 PathProgramCache]: Analyzing trace with hash -641547586, now seen corresponding path program 2 times [2022-07-22 14:58:29,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:29,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471868361] [2022-07-22 14:58:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471868361] [2022-07-22 14:58:29,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471868361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961924384] [2022-07-22 14:58:29,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:58:29,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:29,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:29,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:30,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:58:30,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:58:30,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:58:30,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 14:58:30,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:30,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:58:30,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961924384] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:30,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:30,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-07-22 14:58:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400783711] [2022-07-22 14:58:30,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:30,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:58:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:30,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:58:30,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:58:30,157 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:30,199 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-22 14:58:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:58:30,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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) Word has length 35 [2022-07-22 14:58:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:30,200 INFO L225 Difference]: With dead ends: 86 [2022-07-22 14:58:30,200 INFO L226 Difference]: Without dead ends: 64 [2022-07-22 14:58:30,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:58:30,201 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:30,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-22 14:58:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2022-07-22 14:58:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-22 14:58:30,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 35 [2022-07-22 14:58:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:30,206 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-22 14:58:30,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-22 14:58:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:58:30,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:30,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:30,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:30,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:30,425 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash -2028742216, now seen corresponding path program 1 times [2022-07-22 14:58:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426024138] [2022-07-22 14:58:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 14:58:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:30,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426024138] [2022-07-22 14:58:30,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426024138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:30,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79747370] [2022-07-22 14:58:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:30,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:30,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:30,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:58:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:30,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:58:30,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 14:58:30,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 14:58:30,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79747370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:30,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:30,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-22 14:58:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34018401] [2022-07-22 14:58:30,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:30,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:58:30,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:58:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:58:30,582 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:30,609 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-07-22 14:58:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:58:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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) Word has length 40 [2022-07-22 14:58:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:30,610 INFO L225 Difference]: With dead ends: 65 [2022-07-22 14:58:30,610 INFO L226 Difference]: Without dead ends: 57 [2022-07-22 14:58:30,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:58:30,611 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:30,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-22 14:58:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-07-22 14:58:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-07-22 14:58:30,616 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 40 [2022-07-22 14:58:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:30,617 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-07-22 14:58:30,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-07-22 14:58:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 14:58:30,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:30,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:30,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:30,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:30,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -955427842, now seen corresponding path program 3 times [2022-07-22 14:58:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:30,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424562755] [2022-07-22 14:58:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 14:58:30,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424562755] [2022-07-22 14:58:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424562755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815776419] [2022-07-22 14:58:30,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:58:30,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:30,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:30,902 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:30,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:58:31,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 14:58:31,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:58:31,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:58:31,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 14:58:31,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:58:31,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815776419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:58:31,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 14:58:31,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-22 14:58:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322721787] [2022-07-22 14:58:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:58:31,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:58:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:58:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:58:31,137 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:31,155 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-22 14:58:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:58:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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) Word has length 40 [2022-07-22 14:58:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:31,156 INFO L225 Difference]: With dead ends: 62 [2022-07-22 14:58:31,156 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:58:31,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:58:31,157 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:31,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:58:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-22 14:58:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-22 14:58:31,161 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2022-07-22 14:58:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:31,161 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-22 14:58:31,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-22 14:58:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 14:58:31,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:31,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:31,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:31,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:31,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1585154848, now seen corresponding path program 1 times [2022-07-22 14:58:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:31,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57009894] [2022-07-22 14:58:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57009894] [2022-07-22 14:58:31,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57009894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:31,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736927634] [2022-07-22 14:58:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:31,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:31,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:31,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 14:58:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:31,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-22 14:58:31,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:31,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:58:31,993 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:58:31,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:58:32,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:58:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:58:32,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-22 14:58:32,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:58:32,245 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:58:32,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2022-07-22 14:58:32,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-07-22 14:58:32,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-07-22 14:58:32,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-22 14:58:32,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-22 14:58:32,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-22 14:58:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:58:32,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:32,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-07-22 14:58:32,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2022-07-22 14:58:32,666 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_807 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_807) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-22 14:58:32,681 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_807 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_807) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_810 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-22 14:58:32,692 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_807) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_810 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-22 14:58:32,701 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_807 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_807) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_810 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-22 14:58:32,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 230 [2022-07-22 14:58:32,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 178 [2022-07-22 14:58:32,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 162 [2022-07-22 14:58:32,765 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_806 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_806)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_806))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) is different from false [2022-07-22 14:58:34,804 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_806 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-07-22 14:58:36,817 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (forall ((v_ArrVal_806 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|)))) is different from false [2022-07-22 14:58:38,848 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_806 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))))) is different from false [2022-07-22 14:58:38,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-22 14:58:38,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:58:38,905 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 14:58:38,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2022-07-22 14:58:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-22 14:58:38,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736927634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:38,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:38,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 51 [2022-07-22 14:58:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958615265] [2022-07-22 14:58:38,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:38,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 14:58:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 14:58:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1692, Unknown=8, NotChecked=712, Total=2550 [2022-07-22 14:58:38,988 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 51 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:41,171 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_806 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-22 14:58:43,175 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_806 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-22 14:58:45,179 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_806 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-22 14:58:45,198 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (forall ((v_ArrVal_806 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|)))) is different from false [2022-07-22 14:58:45,202 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_806 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_19| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_19|) (forall ((v_ArrVal_806 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_19| v_ArrVal_806) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-07-22 14:58:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:45,902 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-07-22 14:58:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 14:58:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 51 states have internal predecessors, (105), 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) Word has length 41 [2022-07-22 14:58:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:45,903 INFO L225 Difference]: With dead ends: 51 [2022-07-22 14:58:45,903 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 14:58:45,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=329, Invalid=3016, Unknown=13, NotChecked=1612, Total=4970 [2022-07-22 14:58:45,905 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 104 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:45,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 355 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 659 Invalid, 0 Unknown, 316 Unchecked, 0.3s Time] [2022-07-22 14:58:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 14:58:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-07-22 14:58:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-22 14:58:45,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2022-07-22 14:58:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-22 14:58:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 51 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-22 14:58:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 14:58:45,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:58:45,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:58:45,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:46,111 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,SelfDestructingSolverStorable11 [2022-07-22 14:58:46,112 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:58:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:58:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1946814136, now seen corresponding path program 2 times [2022-07-22 14:58:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:58:46,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683331786] [2022-07-22 14:58:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:58:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:58:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:58:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 14:58:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:58:46,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683331786] [2022-07-22 14:58:46,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683331786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:58:46,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106263458] [2022-07-22 14:58:46,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:58:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:58:46,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:58:46,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:58:46,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 14:58:46,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:58:46,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:58:46,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 14:58:46,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:58:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 14:58:46,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:58:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 14:58:46,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106263458] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:58:46,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:58:46,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-22 14:58:46,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016132736] [2022-07-22 14:58:46,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:58:46,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:58:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:58:46,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:58:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:58:46,379 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:58:46,428 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-22 14:58:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:58:46,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) Word has length 42 [2022-07-22 14:58:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:58:46,429 INFO L225 Difference]: With dead ends: 43 [2022-07-22 14:58:46,430 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 14:58:46,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:58:46,434 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:58:46,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:58:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 14:58:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 14:58:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 14:58:46,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-07-22 14:58:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:58:46,435 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 14:58:46,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:58:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 14:58:46,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 14:58:46,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:58:46,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 14:58:46,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 14:58:46,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 14:59:08,980 WARN L233 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 53 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-22 14:59:29,177 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 52 DAG size of output: 32 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-22 14:59:31,686 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-07-22 14:59:31,686 INFO L899 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2022-07-22 14:59:31,686 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse15 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (select .cse13 .cse15)) (.cse4 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse1 (select .cse12 .cse15))) (let ((.cse2 (not (= .cse1 |ULTIMATE.start_main_~s~0#1.base|))) (.cse7 (= (select (select |#memory_int| .cse1) .cse6) .cse4)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse5 (let ((.cse14 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse14) (and .cse0 .cse14))))) (or (and .cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse1) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) .cse2 .cse3 (= |ULTIMATE.start_sll_update_at_~data#1| .cse4) .cse5 (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse6) .cse7 .cse8) (let ((.cse9 (select .cse13 4)) (.cse11 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse10 (select .cse12 4))) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse9) (= (select (select |#memory_int| .cse10) .cse9) .cse11) .cse2 .cse3 (= |ULTIMATE.start_sll_update_at_~data#1| .cse11) (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse10) .cse5 .cse7 .cse8)) (and .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5))))) [2022-07-22 14:59:31,686 INFO L899 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L895 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))) (or (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3) (and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse1 (<= 1 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse2 .cse3))) [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-07-22 14:59:31,687 INFO L895 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) [2022-07-22 14:59:31,687 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse7 (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse0 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse3 (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse4 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse0 (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|)) .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| (select .cse5 4))) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse6) (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse7 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (forall ((v_ArrVal_356 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_356) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse0 (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse1 (<= |ULTIMATE.start_main_~i~0#1| 1) .cse6) (and .cse7 (not (= (select .cse5 (+ 4 |ULTIMATE.start_sll_update_at_~head#1.offset|)) |ULTIMATE.start_main_~s~0#1.base|)) .cse0 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) .cse1 .cse2 .cse3 .cse4 .cse6))) [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse22 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse14 (select .cse20 .cse22)) (.cse13 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse11 (select .cse21 .cse22)) (.cse15 (select .cse21 4)) (.cse16 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse17 (select .cse20 4))) (let ((.cse0 (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse17)) (.cse3 (let ((.cse18 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse19 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse18 .cse19) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse18 .cse19)))) (.cse4 (= (select (select |#memory_int| .cse15) .cse17) .cse16)) (.cse5 (not (= .cse11 |ULTIMATE.start_main_~s~0#1.base|))) (.cse6 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse7 (= |ULTIMATE.start_sll_update_at_~data#1| .cse16)) (.cse8 (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse15)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse9 (= (select (select |#memory_int| .cse11) .cse14) .cse13)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse2 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse2))) (and .cse0 (= (select (select |#memory_int| .cse1) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse2)) |ULTIMATE.start_main_~expected~0#1|) .cse3 (<= 1 |ULTIMATE.start_sll_get_data_at_~index#1|) .cse4 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 1) .cse5 .cse6 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| .cse1)) .cse7 .cse8 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) .cse9 .cse10))) (and .cse3 (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse11) (= .cse12 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 (= |ULTIMATE.start_sll_update_at_~data#1| .cse13) (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse14) .cse9 .cse10 (= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) .cse0 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~expected~0#1| .cse12) .cse7 .cse8 (<= .cse12 |ULTIMATE.start_main_~expected~0#1|) .cse9 .cse10))))) [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-07-22 14:59:31,687 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-07-22 14:59:31,687 INFO L899 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) .cse8))) (let ((.cse3 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse10 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse11 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse2 (not (= .cse0 |ULTIMATE.start_main_~s~0#1.base|))) (.cse13 (= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse14 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_sll_create_#res#1.base|))) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)) (.cse16 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse7 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse6 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) .cse8)) (.cse4 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse0) (= .cse1 |ULTIMATE.start_main_~len~0#1|) .cse2 .cse3 (= |ULTIMATE.start_sll_update_at_~data#1| .cse4) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5 (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse6) (= (select (select |#memory_int| .cse0) .cse6) .cse4) .cse7)) (and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|) (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse9 .cse10 .cse11 .cse12 .cse3 (forall ((v_ArrVal_356 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_356) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse13 .cse14 .cse5 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse1 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_main_~i~0#1| 1) .cse15 .cse16 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse5 .cse15 .cse16 .cse7))))) [2022-07-22 14:59:31,688 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse3) (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse3 .cse4))) [2022-07-22 14:59:31,688 INFO L899 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 14:59:31,688 INFO L895 garLoopResultBuilder]: At program point L604(lines 599 605) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse13 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)) (.cse16 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse6 (select .cse13 .cse16)) (.cse5 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse1 (select .cse12 .cse16))) (let ((.cse0 (let ((.cse14 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (<= |ULTIMATE.start_main_~i~0#1| 1))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse14 .cse15) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse14 .cse15)))) (.cse3 (not (= .cse1 |ULTIMATE.start_main_~s~0#1.base|))) (.cse4 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse7 (= (select (select |#memory_int| .cse1) .cse6) .cse5)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse1) (= .cse2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~len~0#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse3 .cse4 (= |ULTIMATE.start_sll_update_at_~data#1| .cse5) (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse6) .cse7 .cse8 (= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (let ((.cse9 (select .cse13 4)) (.cse11 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse10 (select .cse12 4))) (and (= |ULTIMATE.start_sll_update_at_~head#1.offset| .cse9) .cse0 (= (select (select |#memory_int| .cse10) .cse9) .cse11) .cse3 .cse4 (<= |ULTIMATE.start_main_~expected~0#1| .cse2) (= |ULTIMATE.start_sll_update_at_~data#1| .cse11) (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse10) (<= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_get_data_at_#res#1|) (<= .cse2 |ULTIMATE.start_main_~expected~0#1|) .cse7 .cse8)))))) [2022-07-22 14:59:31,690 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-07-22 14:59:31,692 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:59:31,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,712 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,713 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,715 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,716 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,717 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,738 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,739 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,740 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,766 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,768 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:59:31 BoogieIcfgContainer [2022-07-22 14:59:31,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:59:31,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:59:31,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:59:31,784 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:59:31,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:58:25" (3/4) ... [2022-07-22 14:59:31,786 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 14:59:31,796 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-22 14:59:31,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-22 14:59:31,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 14:59:31,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 14:59:31,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && head == 0) && len == 2) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) || (2 == len && len == 2)) || (((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && 1 <= len) && len == 2) && \valid[\result] == 1) [2022-07-22 14:59:31,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && head == 0) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head) [2022-07-22 14:59:31,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((head == #memory_$Pointer$[s][s + 4] && unknown-#memory_int-unknown[s][s] == len) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + 1) && 2 <= i) && len == 2) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || (((((((((((((((((len == data && 1 <= i) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && head == 0) && index <= 0) && (forall v_ArrVal_356 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4] := v_ArrVal_356][s][s])) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && head == s) && i <= 1) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0)) || (((((((((((i == 0 && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && head == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) [2022-07-22 14:59:31,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 == len && \valid[temp] == 1) && temp == 0) && len == 2) && \valid[\result] == 1) || ((((((((!(temp == head) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && 1 <= len) && \result == 0) && !(\result == head)) && len == 2) && \valid[\result] == 1) [2022-07-22 14:59:31,815 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((i == 0 && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && head == 0) && data == len + i) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && s == head) && index == i) && head == s) && !(head == #memory_$Pointer$[head][4])) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) || (((((((((head == #memory_$Pointer$[s][4] && 1 <= i) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && (forall v_ArrVal_356 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_356][s][s])) && data == len + i) && head == #memory_$Pointer$[s][4]) && len == 2) && i <= 1) && s == 0)) || ((((((((unknown-#memory_int-unknown[s][s] == len && !(#memory_$Pointer$[head][4 + head] == s)) && data == len + i) && data == len + 1) && len == 2) && s == head) && index == i) && head == s) && s == 0) [2022-07-22 14:59:31,816 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1)) && \result == expected) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[head][head] == expected) && unknown-#memory_int-unknown[s][s] == len) && 2 == expected) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + 1) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && index == 0) || ((((((((((((head == #memory_$Pointer$[s][4] && (((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1))) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] == len + i) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && expected <= unknown-#memory_int-unknown[head][head]) && data == len + i) && head == #memory_$Pointer$[s][4]) && \result <= expected) && expected <= \result) && unknown-#memory_int-unknown[head][head] <= expected) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) [2022-07-22 14:59:31,834 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 14:59:31,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:59:31,835 INFO L158 Benchmark]: Toolchain (without parser) took 67374.04ms. Allocated memory was 113.2MB in the beginning and 255.9MB in the end (delta: 142.6MB). Free memory was 84.5MB in the beginning and 144.2MB in the end (delta: -59.6MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,835 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:59:31,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.94ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 84.4MB in the beginning and 141.7MB in the end (delta: -57.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,836 INFO L158 Benchmark]: Boogie Preprocessor took 39.57ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,837 INFO L158 Benchmark]: RCFGBuilder took 254.76ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 124.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,837 INFO L158 Benchmark]: TraceAbstraction took 66625.65ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 124.3MB in the beginning and 147.3MB in the end (delta: -23.1MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,837 INFO L158 Benchmark]: Witness Printer took 51.24ms. Allocated memory is still 255.9MB. Free memory was 147.3MB in the beginning and 144.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 14:59:31,842 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 113.2MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.94ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 84.4MB in the beginning and 141.7MB in the end (delta: -57.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.57ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 254.76ms. Allocated memory is still 176.2MB. Free memory was 137.9MB in the beginning and 124.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 66625.65ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 124.3MB in the beginning and 147.3MB in the end (delta: -23.1MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. * Witness Printer took 51.24ms. Allocated memory is still 255.9MB. Free memory was 147.3MB in the beginning and 144.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 630]: 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 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.5s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 610 mSDsluCounter, 1423 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 501 IncrementalHoareTripleChecker+Unchecked, 1110 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1468 IncrementalHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 313 mSDtfsCounter, 1468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 508 SyntacticMatches, 17 SemanticMatches, 190 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 83 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 32 NumberOfFragments, 1334 HoareAnnotationTreeSize, 12 FomulaSimplifications, 6956 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 3477 FormulaSimplificationTreeSizeReductionInter, 44.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 706 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 947 ConstructedInterpolants, 21 QuantifiedInterpolants, 5875 SizeOfPredicates, 89 NumberOfNonLiveVariables, 2471 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 329/472 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: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2022-07-22 14:59:31,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((i == 0 && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[s][s] == len) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + 1) && ((1 <= i && len == 2) || (i == 0 && len == 2))) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || (((((((((index <= 0 && head == #memory_$Pointer$[s][4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] == len + i) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + i) && head == #memory_$Pointer$[s][4]) && ((1 <= i && len == 2) || (i == 0 && len == 2))) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0)) || ((index <= 0 && 2 <= i) && ((1 <= i && len == 2) || (i == 0 && len == 2))) - InvariantResult [Line: 583]: Loop Invariant [2022-07-22 14:59:31,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && head == 0) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant [2022-07-22 14:59:31,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,885 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,886 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1)) && \result == expected) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[head][head] == expected) && unknown-#memory_int-unknown[s][s] == len) && 2 == expected) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + 1) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && index == 0) || ((((((((((((head == #memory_$Pointer$[s][4] && (((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1))) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] == len + i) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && expected <= unknown-#memory_int-unknown[head][head]) && data == len + i) && head == #memory_$Pointer$[s][4]) && \result <= expected) && expected <= \result) && unknown-#memory_int-unknown[head][head] <= expected) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) - InvariantResult [Line: 585]: Loop Invariant [2022-07-22 14:59:31,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && head == 0) && len == 2) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) || (2 == len && len == 2)) || (((((\valid[temp] == 1 && \valid[head] == 1) && temp == 0) && 1 <= len) && len == 2) && \valid[\result] == 1) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-07-22 14:59:31,887 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,888 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,889 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,890 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,891 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((head == #memory_$Pointer$[s][s + 4] && unknown-#memory_int-unknown[s][s] == len) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + 1) && 2 <= i) && len == 2) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || (((((((((((((((((len == data && 1 <= i) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && head == 0) && index <= 0) && (forall v_ArrVal_356 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4] := v_ArrVal_356][s][s])) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && head == s) && i <= 1) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0)) || (((((((((((i == 0 && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && head == 0) && !(#memory_$Pointer$[s][s + 4] == s)) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((2 == len && \valid[temp] == 1) && temp == 0) && len == 2) && \valid[\result] == 1) || ((((((((!(temp == head) && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && 1 <= len) && \result == 0) && !(\result == head)) && len == 2) && \valid[\result] == 1) - InvariantResult [Line: 600]: Loop Invariant [2022-07-22 14:59:31,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((head == #memory_$Pointer$[s][4] && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] == expected) && (((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1))) && 1 <= index) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] == len + i) && index <= 1) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && !(head == #memory_$Pointer$[head][head + 4])) && data == len + i) && head == #memory_$Pointer$[s][4]) && head == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) || ((((((((((((((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1)) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[head][head] == expected) && unknown-#memory_int-unknown[s][s] == len) && 2 == expected) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && data == len + 1) && head == #memory_$Pointer$[s][s + 4]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) && index == 0)) || (((((((((((index <= 0 && head == #memory_$Pointer$[s][4]) && (((i == 0 && len == 2) && i <= 1) || ((1 <= i && len == 2) && i <= 1))) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] == len + i) && !(#memory_$Pointer$[s][s + 4] == s)) && index <= 0) && expected <= unknown-#memory_int-unknown[head][head]) && data == len + i) && head == #memory_$Pointer$[s][4]) && unknown-#memory_int-unknown[head][head] <= expected) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] == len + 1) && s == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-07-22 14:59:31,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,900 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-22 14:59:31,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_356,QUANTIFIED] [2022-07-22 14:59:31,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-22 14:59:31,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((i == 0 && \valid[temp] == 1) && \valid[head] == 1) && temp == 0) && head == 0) && data == len + i) && \result == 0) && !(#memory_$Pointer$[\result][4] == \result)) && len == 2) && s == head) && index == i) && head == s) && !(head == #memory_$Pointer$[head][4])) && \valid[\result] == 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) || (((((((((head == #memory_$Pointer$[s][4] && 1 <= i) && unknown-#memory_int-unknown[s][s] == len) && index <= 0) && (forall v_ArrVal_356 : [int]int :: len <= unknown-#memory_int-unknown[head := v_ArrVal_356][s][s])) && data == len + i) && head == #memory_$Pointer$[s][4]) && len == 2) && i <= 1) && s == 0)) || ((((((((unknown-#memory_int-unknown[s][s] == len && !(#memory_$Pointer$[head][4 + head] == s)) && data == len + i) && data == len + 1) && len == 2) && s == head) && index == i) && head == s) && s == 0) RESULT: Ultimate proved your program to be correct! [2022-07-22 14:59:31,915 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