./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:34,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:34,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:34,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:34,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:34,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:34,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:34,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:34,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:34,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:34,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:34,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:34,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:34,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:34,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:34,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:34,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:34,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:34,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:34,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:34,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:34,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:34,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:34,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:34,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:34,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:34,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:34,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:34,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:34,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:34,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:34,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:34,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:34,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:34,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:34,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:34,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:34,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:34,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:34,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:34,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:34,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:48:34,924 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:34,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:34,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:34,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:34,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:34,926 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:34,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:34,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:34,927 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:34,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:34,927 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:34,928 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:34,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:34,929 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:34,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:34,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:34,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:34,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:34,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:34,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:34,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:34,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:34,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:34,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:34,931 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2022-02-20 23:48:35,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:35,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:35,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:35,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:35,157 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:35,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2022-02-20 23:48:35,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0b5d3ca/16bf5841333548e1a01c496ca9a8cbff/FLAG24aab2773 [2022-02-20 23:48:35,646 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:35,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2022-02-20 23:48:35,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0b5d3ca/16bf5841333548e1a01c496ca9a8cbff/FLAG24aab2773 [2022-02-20 23:48:35,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd0b5d3ca/16bf5841333548e1a01c496ca9a8cbff [2022-02-20 23:48:35,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:35,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:35,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:35,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:35,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:35,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:35" (1/1) ... [2022-02-20 23:48:35,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@922fa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:35, skipping insertion in model container [2022-02-20 23:48:35,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:35" (1/1) ... [2022-02-20 23:48:36,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:36,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:36,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:36,460 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:36,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:36,573 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:36,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36 WrapperNode [2022-02-20 23:48:36,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:36,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:36,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:36,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:36,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,665 INFO L137 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2022-02-20 23:48:36,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:36,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:36,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:36,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:36,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:36,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:36,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:36,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:36,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:36,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:36,727 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-02-20 23:48:36,736 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-02-20 23:48:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:48:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:48:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:36,830 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:36,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:37,234 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:37,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:37,239 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:48:37,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:37 BoogieIcfgContainer [2022-02-20 23:48:37,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:37,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:37,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:37,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:37,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:35" (1/3) ... [2022-02-20 23:48:37,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6263d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:37, skipping insertion in model container [2022-02-20 23:48:37,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (2/3) ... [2022-02-20 23:48:37,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6263d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:37, skipping insertion in model container [2022-02-20 23:48:37,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:37" (3/3) ... [2022-02-20 23:48:37,254 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2022-02-20 23:48:37,257 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:37,258 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-02-20 23:48:37,297 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:37,301 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:48:37,302 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-02-20 23:48:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 states have internal predecessors, (95), 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-02-20 23:48:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:48:37,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:48:37,317 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-02-20 23:48:37,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525879773] [2022-02-20 23:48:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {93#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {93#true} is VALID [2022-02-20 23:48:37,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {95#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:48:37,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {96#(= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) 1)} is VALID [2022-02-20 23:48:37,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {96#(= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) 1)} assume !(1 == #valid[append_~plist#1.base]); {94#false} is VALID [2022-02-20 23:48:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:37,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525879773] [2022-02-20 23:48:37,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525879773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:37,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459006325] [2022-02-20 23:48:37,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-02-20 23:48:37,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:37,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:37,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:37,564 INFO L87 Difference]: Start difference. First operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 states have internal predecessors, (95), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,786 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-02-20 23:48:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:37,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-02-20 23:48:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-02-20 23:48:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-02-20 23:48:37,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-02-20 23:48:37,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,892 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:48:37,892 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:48:37,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-20 23:48:37,895 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:37,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 69 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:48:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-02-20 23:48:37,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:37,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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-02-20 23:48:37,916 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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-02-20 23:48:37,917 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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-02-20 23:48:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,920 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-02-20 23:48:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-02-20 23:48:37,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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 99 states. [2022-02-20 23:48:37,922 INFO L87 Difference]: Start difference. First operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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 99 states. [2022-02-20 23:48:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,925 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-02-20 23:48:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-02-20 23:48:37,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:37,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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-02-20 23:48:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-02-20 23:48:37,930 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 4 [2022-02-20 23:48:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:37,930 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-02-20 23:48:37,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-02-20 23:48:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:48:37,931 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:48:37,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:37,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-02-20 23:48:37,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895862787] [2022-02-20 23:48:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {482#true} is VALID [2022-02-20 23:48:37,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {484#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1))} is VALID [2022-02-20 23:48:37,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {485#(and (= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:48:37,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#(and (= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} assume !(4 + append_~plist#1.offset <= #length[append_~plist#1.base] && 0 <= append_~plist#1.offset); {483#false} is VALID [2022-02-20 23:48:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:37,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895862787] [2022-02-20 23:48:37,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895862787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:37,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296035347] [2022-02-20 23:48:37,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-02-20 23:48:37,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:37,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:37,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:37,996 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,206 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:48:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:38,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2022-02-20 23:48:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-02-20 23:48:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-02-20 23:48:38,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 103 transitions. [2022-02-20 23:48:38,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,296 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:48:38,296 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 23:48:38,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-20 23:48:38,297 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 143 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:38,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 49 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 23:48:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2022-02-20 23:48:38,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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-02-20 23:48:38,302 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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-02-20 23:48:38,302 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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-02-20 23:48:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,309 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:48:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 23:48:38,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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 93 states. [2022-02-20 23:48:38,311 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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 93 states. [2022-02-20 23:48:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,313 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:48:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-02-20 23:48:38,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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-02-20 23:48:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-02-20 23:48:38,316 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 4 [2022-02-20 23:48:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,316 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-02-20 23:48:38,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-02-20 23:48:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-02-20 23:48:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:48:38,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:48:38,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:38,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-02-20 23:48:38,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892038889] [2022-02-20 23:48:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {852#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {852#true} is VALID [2022-02-20 23:48:38,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {852#true} is VALID [2022-02-20 23:48:38,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {854#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} is VALID [2022-02-20 23:48:38,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {854#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {854#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} is VALID [2022-02-20 23:48:38,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {854#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} assume !(1 == #valid[append_~item~0#1.base]); {853#false} is VALID [2022-02-20 23:48:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:38,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892038889] [2022-02-20 23:48:38,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892038889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:38,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358229429] [2022-02-20 23:48:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-02-20 23:48:38,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:38,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:38,350 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,447 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:48:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:38,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-02-20 23:48:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-02-20 23:48:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-02-20 23:48:38,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-02-20 23:48:38,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,515 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:48:38,515 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:48:38,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-20 23:48:38,516 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:38,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:48:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2022-02-20 23:48:38,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:38,520 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:38,520 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,522 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:48:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:48:38,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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 89 states. [2022-02-20 23:48:38,523 INFO L87 Difference]: Start difference. First operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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 89 states. [2022-02-20 23:48:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,525 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:48:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:48:38,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-02-20 23:48:38,528 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2022-02-20 23:48:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,528 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-02-20 23:48:38,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-02-20 23:48:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:48:38,529 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,529 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:48:38,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:38,529 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-02-20 23:48:38,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72865104] [2022-02-20 23:48:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1203#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {1203#true} is VALID [2022-02-20 23:48:38,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1203#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {1203#true} is VALID [2022-02-20 23:48:38,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {1203#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {1205#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:38,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {1205#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {1205#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:38,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {1205#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} assume !(4 + append_~item~0#1.offset <= #length[append_~item~0#1.base] && 0 <= append_~item~0#1.offset); {1204#false} is VALID [2022-02-20 23:48:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:38,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72865104] [2022-02-20 23:48:38,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72865104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:38,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580563243] [2022-02-20 23:48:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-02-20 23:48:38,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:38,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:38,569 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,659 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:48:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-02-20 23:48:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 23:48:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 23:48:38,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-02-20 23:48:38,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,730 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:48:38,730 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:48:38,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-20 23:48:38,731 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:38,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:48:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-02-20 23:48:38,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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-02-20 23:48:38,735 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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-02-20 23:48:38,735 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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-02-20 23:48:38,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,737 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:48:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-02-20 23:48:38,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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 76 states. [2022-02-20 23:48:38,738 INFO L87 Difference]: Start difference. First operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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 76 states. [2022-02-20 23:48:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,740 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:48:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-02-20 23:48:38,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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-02-20 23:48:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-02-20 23:48:38,742 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2022-02-20 23:48:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,746 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-02-20 23:48:38,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02-20 23:48:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-20 23:48:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:48:38,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:38,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:38,747 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:38,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-02-20 23:48:38,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052418851] [2022-02-20 23:48:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {1511#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {1511#true} is VALID [2022-02-20 23:48:38,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {1511#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {1513#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:38,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1513#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {1514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0))} is VALID [2022-02-20 23:48:38,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {1514#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {1515#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.base| 0))} is VALID [2022-02-20 23:48:38,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {1515#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.base| 0))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {1516#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:48:38,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1516#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {1516#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:48:38,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {1516#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {1517#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:48:38,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {1517#(and (= |ULTIMATE.start_append_#t~mem6#1.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0; {1512#false} is VALID [2022-02-20 23:48:38,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {1512#false} SUMMARY for call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L535 {1512#false} is VALID [2022-02-20 23:48:38,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {1512#false} assume !(1 == #valid[append_#t~mem7#1.base]); {1512#false} is VALID [2022-02-20 23:48:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:38,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052418851] [2022-02-20 23:48:38,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052418851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:38,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725604520] [2022-02-20 23:48:38,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2022-02-20 23:48:38,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-02-20 23:48:38,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:38,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:38,834 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-02-20 23:48:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,140 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-02-20 23:48:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:48:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2022-02-20 23:48:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-02-20 23:48:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-02-20 23:48:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-02-20 23:48:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-02-20 23:48:39,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2022-02-20 23:48:39,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,197 INFO L225 Difference]: With dead ends: 86 [2022-02-20 23:48:39,197 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:48:39,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:48:39,198 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:39,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 349 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:48:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-02-20 23:48:39,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:39,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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-02-20 23:48:39,203 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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-02-20 23:48:39,203 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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-02-20 23:48:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,205 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-02-20 23:48:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:48:39,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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 86 states. [2022-02-20 23:48:39,206 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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 86 states. [2022-02-20 23:48:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,207 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-02-20 23:48:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:48:39,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:39,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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-02-20 23:48:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-02-20 23:48:39,209 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 10 [2022-02-20 23:48:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:39,210 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-02-20 23:48:39,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-02-20 23:48:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-02-20 23:48:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:39,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:39,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:39,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:39,211 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053176, now seen corresponding path program 1 times [2022-02-20 23:48:39,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:39,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343926419] [2022-02-20 23:48:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:39,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {1871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {1871#true} is VALID [2022-02-20 23:48:39,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1871#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {1871#true} is VALID [2022-02-20 23:48:39,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {1871#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {1874#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {1874#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {1874#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1874#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:39,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:39,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:39,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:39,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume main_~length~0#1 > 0; {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:39,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1875#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L548 {1876#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:48:39,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} assume !(1 == #valid[main_#t~mem13#1.base]); {1872#false} is VALID [2022-02-20 23:48:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:39,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:39,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343926419] [2022-02-20 23:48:39,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343926419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:39,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:39,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:39,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466512897] [2022-02-20 23:48:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:39,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-02-20 23:48:39,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:39,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:39,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:39,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:39,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:39,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:39,303 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,562 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:48:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:39,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-02-20 23:48:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-02-20 23:48:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-02-20 23:48:39,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-02-20 23:48:39,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,628 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:48:39,628 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:48:39,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:39,629 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 109 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:39,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 102 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:48:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-02-20 23:48:39,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:39,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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-02-20 23:48:39,632 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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-02-20 23:48:39,632 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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-02-20 23:48:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,633 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:48:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:48:39,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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 89 states. [2022-02-20 23:48:39,634 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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 89 states. [2022-02-20 23:48:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,636 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:48:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:48:39,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:39,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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-02-20 23:48:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-02-20 23:48:39,638 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 17 [2022-02-20 23:48:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:39,638 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-02-20 23:48:39,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-02-20 23:48:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:39,639 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:39,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:39,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:39,639 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053177, now seen corresponding path program 1 times [2022-02-20 23:48:39,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:39,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857186593] [2022-02-20 23:48:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:39,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {2230#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {2230#true} is VALID [2022-02-20 23:48:39,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {2230#true} is VALID [2022-02-20 23:48:39,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2232#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {2233#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {2233#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {2233#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:39,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {2233#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:39,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:39,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:39,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:39,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_~length~0#1 > 0; {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:39,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L548 {2235#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} is VALID [2022-02-20 23:48:39,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {2235#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} assume !(4 + main_#t~mem13#1.offset <= #length[main_#t~mem13#1.base] && 0 <= main_#t~mem13#1.offset); {2231#false} is VALID [2022-02-20 23:48:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:39,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:39,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857186593] [2022-02-20 23:48:39,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857186593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:39,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:39,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:39,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488715047] [2022-02-20 23:48:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-02-20 23:48:39,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:39,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:39,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:39,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:39,752 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,010 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-02-20 23:48:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-02-20 23:48:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-02-20 23:48:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-02-20 23:48:40,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2022-02-20 23:48:40,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,086 INFO L225 Difference]: With dead ends: 91 [2022-02-20 23:48:40,087 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 23:48:40,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:40,087 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 99 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 23:48:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-02-20 23:48:40,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:40,090 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:40,090 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,091 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-02-20 23:48:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-02-20 23:48:40,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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 91 states. [2022-02-20 23:48:40,092 INFO L87 Difference]: Start difference. First operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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 91 states. [2022-02-20 23:48:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,093 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-02-20 23:48:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-02-20 23:48:40,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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-02-20 23:48:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-02-20 23:48:40,095 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2022-02-20 23:48:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,096 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-02-20 23:48:40,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-20 23:48:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-02-20 23:48:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:48:40,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:40,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:48:40,100 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2076126984, now seen corresponding path program 1 times [2022-02-20 23:48:40,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548486446] [2022-02-20 23:48:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {2594#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {2594#true} is VALID [2022-02-20 23:48:40,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {2594#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:40,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {2596#(= |ULTIMATE.start_main_~length~0#1| 0)} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2597#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:48:40,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {2597#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {2597#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:48:40,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {2597#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {2597#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-20 23:48:40,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {2597#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~length~0#1 > 0); {2595#false} is VALID [2022-02-20 23:48:40,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {2595#false} assume !(main_~length~0#1 > 0); {2595#false} is VALID [2022-02-20 23:48:40,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {2595#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; {2595#false} is VALID [2022-02-20 23:48:40,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {2595#false} assume !(#valid == main_old_#valid#1); {2595#false} is VALID [2022-02-20 23:48:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:40,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548486446] [2022-02-20 23:48:40,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548486446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:40,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351321659] [2022-02-20 23:48:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,149 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 18 [2022-02-20 23:48:40,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 23:48:40,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:40,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:40,161 INFO L87 Difference]: Start difference. First operand 79 states and 85 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-02-20 23:48:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,245 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:48:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:40,245 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 18 [2022-02-20 23:48:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:48:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-02-20 23:48:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 23:48:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-02-20 23:48:40,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-02-20 23:48:40,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,300 INFO L225 Difference]: With dead ends: 78 [2022-02-20 23:48:40,300 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 23:48:40,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:40,300 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 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-02-20 23:48:40,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 23:48:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-02-20 23:48:40,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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-02-20 23:48:40,302 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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-02-20 23:48:40,303 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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-02-20 23:48:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,304 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:48:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:48:40,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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 78 states. [2022-02-20 23:48:40,305 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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 78 states. [2022-02-20 23:48:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,306 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-20 23:48:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-20 23:48:40,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 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-02-20 23:48:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-02-20 23:48:40,308 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 18 [2022-02-20 23:48:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,308 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-02-20 23:48:40,308 INFO L471 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-02-20 23:48:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-02-20 23:48:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:40,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:40,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:48:40,309 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939784, now seen corresponding path program 1 times [2022-02-20 23:48:40,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269928881] [2022-02-20 23:48:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {2908#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {2908#true} is VALID [2022-02-20 23:48:40,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2908#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {2908#true} is VALID [2022-02-20 23:48:40,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {2908#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {2910#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {2911#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {2911#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {2911#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:40,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {2911#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:40,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:40,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:40,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:40,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_~length~0#1 > 0; {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:40,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {2912#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L548 {2913#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem13#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} is VALID [2022-02-20 23:48:40,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {2913#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem13#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4); srcloc: L548-1 {2914#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:40,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {2914#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {2914#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:40,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {2914#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L549 {2915#(and (<= 0 |ULTIMATE.start_main_#t~mem15#1.offset|) (<= (+ 8 |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)))} is VALID [2022-02-20 23:48:40,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {2915#(and (<= 0 |ULTIMATE.start_main_#t~mem15#1.offset|) (<= (+ 8 |ULTIMATE.start_main_#t~mem15#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)))} assume !(4 + (4 + main_#t~mem15#1.offset) <= #length[main_#t~mem15#1.base] && 0 <= 4 + main_#t~mem15#1.offset); {2909#false} is VALID [2022-02-20 23:48:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:40,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269928881] [2022-02-20 23:48:40,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269928881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:40,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137776824] [2022-02-20 23:48:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:40,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-02-20 23:48:40,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:40,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:40,464 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-02-20 23:48:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,820 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-02-20 23:48:40,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:40,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-02-20 23:48:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-02-20 23:48:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-02-20 23:48:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-02-20 23:48:40,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-02-20 23:48:40,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,880 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:48:40,880 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:48:40,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:40,880 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 178 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 106 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:48:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 23:48:40,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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-02-20 23:48:40,882 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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-02-20 23:48:40,882 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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-02-20 23:48:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,883 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-02-20 23:48:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-02-20 23:48:40,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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 73 states. [2022-02-20 23:48:40,884 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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 73 states. [2022-02-20 23:48:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,885 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-02-20 23:48:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-02-20 23:48:40,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 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-02-20 23:48:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-02-20 23:48:40,887 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 20 [2022-02-20 23:48:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,887 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-02-20 23:48:40,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-02-20 23:48:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-02-20 23:48:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:40,888 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:40,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:48:40,888 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939783, now seen corresponding path program 1 times [2022-02-20 23:48:40,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952076800] [2022-02-20 23:48:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {3216#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {3216#true} is VALID [2022-02-20 23:48:40,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {3216#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {3216#true} is VALID [2022-02-20 23:48:40,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {3216#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {3216#true} is VALID [2022-02-20 23:48:40,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {3216#true} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {3216#true} is VALID [2022-02-20 23:48:40,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {3216#true} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {3216#true} is VALID [2022-02-20 23:48:40,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {3216#true} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {3216#true} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {3216#true} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {3216#true} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {3216#true} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {3216#true} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {3216#true} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3216#true} is VALID [2022-02-20 23:48:40,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {3216#true} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {3216#true} is VALID [2022-02-20 23:48:40,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {3216#true} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {3216#true} is VALID [2022-02-20 23:48:40,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {3216#true} assume main_~length~0#1 > 0; {3216#true} is VALID [2022-02-20 23:48:40,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {3216#true} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L548 {3218#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|)} is VALID [2022-02-20 23:48:40,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|)} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4); srcloc: L548-1 {3219#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:40,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {3219#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {3219#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:40,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {3219#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L549 {3220#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:48:40,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3220#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume !(1 == #valid[main_#t~mem15#1.base]); {3217#false} is VALID [2022-02-20 23:48:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:40,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952076800] [2022-02-20 23:48:40,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952076800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:40,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584397836] [2022-02-20 23:48:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:40,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-20 23:48:40,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:40,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:40,946 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-20 23:48:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,142 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-02-20 23:48:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-20 23:48:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 23:48:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-20 23:48:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 23:48:41,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-02-20 23:48:41,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,207 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:48:41,207 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:48:41,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:41,208 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:41,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:48:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-20 23:48:41,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:41,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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-02-20 23:48:41,210 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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-02-20 23:48:41,211 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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-02-20 23:48:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,212 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-02-20 23:48:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-02-20 23:48:41,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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 72 states. [2022-02-20 23:48:41,212 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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 72 states. [2022-02-20 23:48:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,213 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-02-20 23:48:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-02-20 23:48:41,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:41,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 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-02-20 23:48:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2022-02-20 23:48:41,215 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2022-02-20 23:48:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:41,215 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2022-02-20 23:48:41,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-20 23:48:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-02-20 23:48:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:48:41,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:41,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:41,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:48:41,216 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1054427643, now seen corresponding path program 1 times [2022-02-20 23:48:41,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:41,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407141617] [2022-02-20 23:48:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {3515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {3515#true} is VALID [2022-02-20 23:48:41,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {3517#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {3518#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {3519#(and (= |ULTIMATE.start_append_#t~ite10#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {3519#(and (= |ULTIMATE.start_append_#t~ite10#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {3520#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {3520#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {3520#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:41,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {3520#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_~length~0#1 > 0; {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L548 {3522#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem13#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:48:41,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {3522#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem13#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4); srcloc: L548-1 {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:41,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {3521#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L549 {3523#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem15#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem15#1.offset|)) 0) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} is VALID [2022-02-20 23:48:41,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem15#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem15#1.offset|)) 0) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4); srcloc: L549-1 {3524#(= |ULTIMATE.start_main_#t~mem16#1.offset| 0)} is VALID [2022-02-20 23:48:41,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {3524#(= |ULTIMATE.start_main_#t~mem16#1.offset| 0)} assume !(0 == main_#t~mem16#1.offset); {3516#false} is VALID [2022-02-20 23:48:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:41,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:41,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407141617] [2022-02-20 23:48:41,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407141617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:41,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:41,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:48:41,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284429219] [2022-02-20 23:48:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:41,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 21 [2022-02-20 23:48:41,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:41,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-02-20 23:48:41,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:48:41,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:48:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:41,405 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-02-20 23:48:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,290 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-02-20 23:48:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:48:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 21 [2022-02-20 23:48:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-02-20 23:48:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 138 transitions. [2022-02-20 23:48:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-02-20 23:48:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 138 transitions. [2022-02-20 23:48:42,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 138 transitions. [2022-02-20 23:48:42,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:42,420 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:48:42,420 INFO L226 Difference]: Without dead ends: 137 [2022-02-20 23:48:42,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:48:42,421 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 285 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:42,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 201 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-20 23:48:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2022-02-20 23:48:42,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:42,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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-02-20 23:48:42,432 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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-02-20 23:48:42,433 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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-02-20 23:48:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,434 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-02-20 23:48:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2022-02-20 23:48:42,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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 137 states. [2022-02-20 23:48:42,435 INFO L87 Difference]: Start difference. First operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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 137 states. [2022-02-20 23:48:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,437 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-02-20 23:48:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2022-02-20 23:48:42,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:42,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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-02-20 23:48:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-02-20 23:48:42,439 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2022-02-20 23:48:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:42,439 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-02-20 23:48:42,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-02-20 23:48:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-02-20 23:48:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:48:42,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:42,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:42,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:48:42,440 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1672481337, now seen corresponding path program 1 times [2022-02-20 23:48:42,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:42,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481610233] [2022-02-20 23:48:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:42,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:42,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {4049#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {4049#true} is VALID [2022-02-20 23:48:42,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4049#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {4051#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:48:42,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {4051#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {4052#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {4053#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (<= (+ |ULTIMATE.start_append_#t~ite10#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:48:42,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {4053#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (<= (+ |ULTIMATE.start_append_#t~ite10#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {4054#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {4054#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {4054#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:42,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {4054#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_~length~0#1 > 0; {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L548 {4056#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem13#1.base|) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:48:42,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {4056#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem13#1.base|) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1.base|))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_#t~mem13#1.base, main_#t~mem13#1.offset, 4); srcloc: L548-1 {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:48:42,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {4055#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L549 {4057#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem15#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem15#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {4057#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem15#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem15#1.offset|)) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_#t~mem15#1.base, 4 + main_#t~mem15#1.offset, 4); srcloc: L549-1 {4058#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {4058#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem16#1.offset; {4058#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {4058#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem16#1.base < #StackHeapBarrier); {4050#false} is VALID [2022-02-20 23:48:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:42,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:42,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481610233] [2022-02-20 23:48:42,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481610233] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:42,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:42,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:48:42,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909637238] [2022-02-20 23:48:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:42,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 22 [2022-02-20 23:48:42,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:42,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-02-20 23:48:42,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:42,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:48:42,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:42,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:48:42,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:42,692 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-02-20 23:48:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,610 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-02-20 23:48:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:48:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 22 [2022-02-20 23:48:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-02-20 23:48:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 137 transitions. [2022-02-20 23:48:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-02-20 23:48:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 137 transitions. [2022-02-20 23:48:43,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 137 transitions. [2022-02-20 23:48:43,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:43,745 INFO L225 Difference]: With dead ends: 136 [2022-02-20 23:48:43,745 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 23:48:43,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:48:43,746 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 276 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:43,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 166 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 23:48:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 86. [2022-02-20 23:48:43,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:43,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 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-02-20 23:48:43,748 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 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-02-20 23:48:43,748 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 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-02-20 23:48:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,750 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-02-20 23:48:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2022-02-20 23:48:43,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 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 136 states. [2022-02-20 23:48:43,751 INFO L87 Difference]: Start difference. First operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 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 136 states. [2022-02-20 23:48:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,752 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-02-20 23:48:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2022-02-20 23:48:43,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:43,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 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-02-20 23:48:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-02-20 23:48:43,754 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2022-02-20 23:48:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:43,754 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-02-20 23:48:43,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-02-20 23:48:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-02-20 23:48:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:48:43,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:43,755 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:43,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:48:43,755 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 40 more)] === [2022-02-20 23:48:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2022-02-20 23:48:43,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:43,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773432525] [2022-02-20 23:48:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:43,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {4581#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {4581#true} is VALID [2022-02-20 23:48:43,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {4581#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {4581#true} is VALID [2022-02-20 23:48:43,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {4581#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {4583#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {4584#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {4584#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {4584#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:43,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {4584#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {4585#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {4586#(or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) 1))} is VALID [2022-02-20 23:48:43,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {4586#(or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) 1))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {4587#(or (= (select |#valid| |ULTIMATE.start_append_#t~mem5#1.base|) 1) (= |ULTIMATE.start_append_#t~mem5#1.base| |ULTIMATE.start_append_~item~0#1.base|))} is VALID [2022-02-20 23:48:43,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {4587#(or (= (select |#valid| |ULTIMATE.start_append_#t~mem5#1.base|) 1) (= |ULTIMATE.start_append_#t~mem5#1.base| |ULTIMATE.start_append_~item~0#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0; {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {4588#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} SUMMARY for call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L535 {4589#(= (select |#valid| |ULTIMATE.start_append_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:48:43,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {4589#(= (select |#valid| |ULTIMATE.start_append_#t~mem7#1.base|) 1)} assume !(1 == #valid[append_#t~mem7#1.base]); {4582#false} is VALID [2022-02-20 23:48:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:43,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:43,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773432525] [2022-02-20 23:48:43,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773432525] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:48:43,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858154592] [2022-02-20 23:48:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:43,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:48:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:43,859 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-02-20 23:48:43,922 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-02-20 23:48:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:43,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 23:48:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:44,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:44,185 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-02-20 23:48:44,275 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-02-20 23:48:44,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-02-20 23:48:44,375 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:48:44,376 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 33 treesize of output 24 [2022-02-20 23:48:44,531 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:48:44,532 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 36 treesize of output 16 [2022-02-20 23:48:44,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {4581#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~c~0 := 0; {4581#true} is VALID [2022-02-20 23:48:44,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {4581#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post12#1, main_#t~nondet11#1, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~post18#1, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~post22#1, main_~next~1#1.base, main_~next~1#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~length~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4);main_~length~0#1 := 0; {4596#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:48:44,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {4596#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0);call append_#t~malloc9#1.base, append_#t~malloc9#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite10#1.base, append_#t~ite10#1.offset := append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {4600#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite10#1.base, append_#t~ite10#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L534-3 {4619#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {4619#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~ite10#1.base, append_#t~ite10#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~mem8#1.base, append_#t~mem8#1.offset;havoc append_#t~malloc9#1.base, append_#t~malloc9#1.offset; {4619#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:48:44,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {4619#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L537 {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:48:44,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :end_inline_append } true;main_#t~post12#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:48:44,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647; {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:48:44,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume !!(0 != main_#t~nondet11#1 && ~c~0 < 20);havoc main_#t~nondet11#1; {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:48:44,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {4626#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~post3#1, append_#t~malloc4#1.base, append_#t~malloc4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~ite10#1.base, append_#t~ite10#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~mem8#1.base, append_#t~mem8#1.offset, append_#t~malloc9#1.base, append_#t~malloc9#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;append_#t~post3#1 := ~c~0;~c~0 := 1 + append_#t~post3#1;havoc append_#t~post3#1;call append_#t~malloc4#1.base, append_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc4#1.base, append_#t~malloc4#1.offset;havoc append_#t~malloc4#1.base, append_#t~malloc4#1.offset; {4639#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| 0))} is VALID [2022-02-20 23:48:44,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {4639#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| 0))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L533 {4643#(exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_#t~mem5#1.base|)))} is VALID [2022-02-20 23:48:44,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {4643#(exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_#t~mem5#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem5#1.base, append_#t~mem5#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533-1 {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:48:44,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset; {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:48:44,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L534 {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:48:44,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} assume append_#t~mem6#1.base != 0 || append_#t~mem6#1.offset != 0; {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:48:44,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {4647#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} SUMMARY for call append_#t~mem7#1.base, append_#t~mem7#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L535 {4589#(= (select |#valid| |ULTIMATE.start_append_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:48:44,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {4589#(= (select |#valid| |ULTIMATE.start_append_#t~mem7#1.base|) 1)} assume !(1 == #valid[append_#t~mem7#1.base]); {4582#false} is VALID [2022-02-20 23:48:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:44,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:44,845 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 38 treesize of output 34