./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-1.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/memsafety/test-0232-1.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 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:11,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:11,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:11,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:11,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:11,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:11,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:11,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:11,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:11,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:11,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:11,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:11,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:11,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:11,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:11,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:11,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:11,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:11,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:11,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:11,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:11,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:11,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:11,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:11,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:11,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:11,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:11,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:11,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:11,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:11,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:11,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:11,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:11,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:11,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:11,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:11,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:11,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:11,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:11,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:11,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:11,856 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:45:11,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:11,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:11,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:11,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:11,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:11,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:11,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:11,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:11,871 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:11,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:11,872 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:11,873 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:11,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:11,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:11,873 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:11,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:11,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:11,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:11,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:11,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:11,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:11,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:11,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:11,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:11,875 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 -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-02-20 23:45:12,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:12,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:12,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:12,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:12,166 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:12,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-1.i [2022-02-20 23:45:12,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8736ecb6/e4bbd9424ccf414da478578ec723067c/FLAG1d989e5e2 [2022-02-20 23:45:12,703 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:12,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-1.i [2022-02-20 23:45:12,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8736ecb6/e4bbd9424ccf414da478578ec723067c/FLAG1d989e5e2 [2022-02-20 23:45:12,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8736ecb6/e4bbd9424ccf414da478578ec723067c [2022-02-20 23:45:12,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:12,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:12,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:12,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:12,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:12,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:12" (1/1) ... [2022-02-20 23:45:12,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1771ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:12, skipping insertion in model container [2022-02-20 23:45:12,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:12" (1/1) ... [2022-02-20 23:45:12,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:12,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:13,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:13,035 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:13,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:13,114 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:13,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13 WrapperNode [2022-02-20 23:45:13,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:13,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:13,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:13,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:13,124 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:45:13" (1/1) ... [2022-02-20 23:45:13,140 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:45:13" (1/1) ... [2022-02-20 23:45:13,158 INFO L137 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-02-20 23:45:13,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:13,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:13,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:13,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:13,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:13,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:13,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:13,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:13,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (1/1) ... [2022-02-20 23:45:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:13,212 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:45:13,214 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:45:13,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:13,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:13,311 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:13,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:13,677 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:13,682 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:13,682 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:45:13,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:13 BoogieIcfgContainer [2022-02-20 23:45:13,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:13,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:13,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:13,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:13,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:12" (1/3) ... [2022-02-20 23:45:13,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a703d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:13, skipping insertion in model container [2022-02-20 23:45:13,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:13" (2/3) ... [2022-02-20 23:45:13,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a703d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:13, skipping insertion in model container [2022-02-20 23:45:13,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:13" (3/3) ... [2022-02-20 23:45:13,706 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-02-20 23:45:13,710 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:13,710 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-02-20 23:45:13,768 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:13,773 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:45:13,773 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-02-20 23:45:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 40 states have (on average 2.175) internal successors, (87), 81 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:45:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:13,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:13,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:13,793 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-02-20 23:45:13,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:13,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797660967] [2022-02-20 23:45:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:13,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:13,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#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(14, 2); {85#true} is VALID [2022-02-20 23:45:13,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {87#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:13,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {87#(= (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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {88#(= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) 1)} is VALID [2022-02-20 23:45:13,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {88#(= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) 1)} assume !(1 == #valid[append_~plist#1.base]); {86#false} is VALID [2022-02-20 23:45:13,970 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:45:13,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:13,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797660967] [2022-02-20 23:45:13,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797660967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:13,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:13,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:13,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288531840] [2022-02-20 23:45:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:13,976 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:45:13,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:13,979 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:45:13,983 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:45:13,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:13,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:14,004 INFO L87 Difference]: Start difference. First operand has 82 states, 40 states have (on average 2.175) internal successors, (87), 81 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 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:45:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,217 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-02-20 23:45:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:14,218 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:45:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:14,219 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:45:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-02-20 23:45:14,229 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:45:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-02-20 23:45:14,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 112 transitions. [2022-02-20 23:45:14,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:14,332 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:45:14,332 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 23:45:14,334 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:45:14,336 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:14,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 52 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 23:45:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2022-02-20 23:45:14,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:14,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 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:45:14,360 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 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:45:14,361 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 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:45:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,366 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-02-20 23:45:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-02-20 23:45:14,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 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 91 states. [2022-02-20 23:45:14,368 INFO L87 Difference]: Start difference. First operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 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 91 states. [2022-02-20 23:45:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,377 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-02-20 23:45:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-02-20 23:45:14,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:14,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 71 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:45:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-02-20 23:45:14,384 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2022-02-20 23:45:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:14,384 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-02-20 23:45:14,385 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:45:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:45:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:14,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:14,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:14,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:14,386 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-02-20 23:45:14,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:14,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428591567] [2022-02-20 23:45:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:14,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {440#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(14, 2); {440#true} is VALID [2022-02-20 23:45:14,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {440#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {442#(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:45:14,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#(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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {443#(and (= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:14,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {443#(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); {441#false} is VALID [2022-02-20 23:45:14,481 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:45:14,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:14,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428591567] [2022-02-20 23:45:14,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428591567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:14,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:14,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:14,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229130721] [2022-02-20 23:45:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:14,488 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:45:14,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:14,488 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:45:14,492 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:45:14,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:14,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:14,493 INFO L87 Difference]: Start difference. First operand 72 states and 75 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:45:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,716 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:45:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:14,717 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:45:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:14,717 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:45:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-02-20 23:45:14,720 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:45:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-02-20 23:45:14,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2022-02-20 23:45:14,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:14,819 INFO L225 Difference]: With dead ends: 83 [2022-02-20 23:45:14,819 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 23:45:14,820 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:45:14,824 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:14,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 34 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 23:45:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-02-20 23:45:14,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:14,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 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:45:14,832 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 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:45:14,832 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 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:45:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,836 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:45:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:45:14,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 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 83 states. [2022-02-20 23:45:14,840 INFO L87 Difference]: Start difference. First operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 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 83 states. [2022-02-20 23:45:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,842 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 23:45:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-02-20 23:45:14,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:14,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 72 states have internal predecessors, (79), 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:45:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-02-20 23:45:14,845 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 4 [2022-02-20 23:45:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:14,845 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-02-20 23:45:14,845 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:45:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-02-20 23:45:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:45:14,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:14,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:45:14,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:45:14,846 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-02-20 23:45:14,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:14,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815245890] [2022-02-20 23:45:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:14,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#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(14, 2); {770#true} is VALID [2022-02-20 23:45:14,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {770#true} is VALID [2022-02-20 23:45:14,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {770#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {772#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:14,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {772#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:14,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} assume !(1 == #valid[append_~item~0#1.base]); {771#false} is VALID [2022-02-20 23:45:14,892 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:45:14,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:14,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815245890] [2022-02-20 23:45:14,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815245890] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:14,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:14,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:14,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525611087] [2022-02-20 23:45:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:14,894 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:45:14,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:14,894 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:45:14,900 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:45:14,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:14,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:14,901 INFO L87 Difference]: Start difference. First operand 73 states and 79 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:45:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,992 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:45:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:14,992 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:45:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:14,993 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:45:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 23:45:14,994 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:45:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 23:45:14,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-02-20 23:45:15,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:15,065 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:45:15,065 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:45:15,065 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:45:15,070 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:15,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:45:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-02-20 23:45:15,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:15,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 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:45:15,077 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 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:45:15,077 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 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:45:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,078 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:45:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:45:15,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:15,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:15,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 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 79 states. [2022-02-20 23:45:15,080 INFO L87 Difference]: Start difference. First operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 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 79 states. [2022-02-20 23:45:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,083 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:45:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:45:15,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:15,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:15,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:15,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 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:45:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-02-20 23:45:15,088 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 5 [2022-02-20 23:45:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:15,088 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-02-20 23:45:15,089 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:45:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-02-20 23:45:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:45:15,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:15,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:45:15,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:45:15,090 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-02-20 23:45:15,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:15,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146416787] [2022-02-20 23:45:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:15,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#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(14, 2); {1081#true} is VALID [2022-02-20 23:45:15,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {1081#true} is VALID [2022-02-20 23:45:15,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1083#(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:45:15,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {1083#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1083#(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:45:15,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {1083#(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); {1082#false} is VALID [2022-02-20 23:45:15,130 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:45:15,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:15,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146416787] [2022-02-20 23:45:15,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146416787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:15,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:15,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:15,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351982762] [2022-02-20 23:45:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:15,131 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:45:15,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:15,131 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:45:15,135 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:45:15,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:15,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:15,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:15,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:15,136 INFO L87 Difference]: Start difference. First operand 69 states and 75 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:45:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,219 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-02-20 23:45:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:15,220 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:45:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:15,220 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:45:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 23:45:15,221 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:45:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 23:45:15,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-20 23:45:15,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:15,278 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:45:15,279 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:45:15,279 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:45:15,279 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:15,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:45:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-02-20 23:45:15,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:15,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 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:45:15,282 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 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:45:15,282 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 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:45:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,283 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-02-20 23:45:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-02-20 23:45:15,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:15,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:15,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 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 66 states. [2022-02-20 23:45:15,284 INFO L87 Difference]: Start difference. First operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 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 66 states. [2022-02-20 23:45:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,286 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-02-20 23:45:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-02-20 23:45:15,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:15,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:15,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:15,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 64 states have internal predecessors, (71), 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:45:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-02-20 23:45:15,288 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 5 [2022-02-20 23:45:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:15,288 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-02-20 23:45:15,288 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:45:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-02-20 23:45:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:15,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:15,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:15,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:45:15,289 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-02-20 23:45:15,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:15,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934237392] [2022-02-20 23:45:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:15,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {1349#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(14, 2); {1349#true} is VALID [2022-02-20 23:45:15,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {1351#(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:45:15,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#(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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1352#(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:45:15,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {1352#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1353#(and (= |ULTIMATE.start_append_#t~mem4#1.offset| 0) (= 0 |ULTIMATE.start_append_#t~mem4#1.base|))} is VALID [2022-02-20 23:45:15,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {1353#(and (= |ULTIMATE.start_append_#t~mem4#1.offset| 0) (= 0 |ULTIMATE.start_append_#t~mem4#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {1354#(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:45:15,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {1354#(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~mem4#1.base, append_#t~mem4#1.offset; {1354#(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:45:15,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {1354#(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~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {1355#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.base| 0))} is VALID [2022-02-20 23:45:15,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.base| 0))} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {1350#false} is VALID [2022-02-20 23:45:15,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {1350#false} 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: L533 {1350#false} is VALID [2022-02-20 23:45:15,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {1350#false} assume !(1 == #valid[append_#t~mem6#1.base]); {1350#false} is VALID [2022-02-20 23:45:15,363 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:45:15,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:15,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934237392] [2022-02-20 23:45:15,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934237392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:15,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:15,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:15,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346406269] [2022-02-20 23:45:15,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:15,364 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:45:15,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:15,365 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:45:15,372 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:45:15,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:15,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:15,373 INFO L87 Difference]: Start difference. First operand 65 states and 71 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:45:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,678 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:45:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:45:15,679 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:45:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:15,679 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:45:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 23:45:15,680 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:45:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-02-20 23:45:15,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2022-02-20 23:45:15,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:15,738 INFO L225 Difference]: With dead ends: 76 [2022-02-20 23:45:15,738 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 23:45:15,738 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:45:15,739 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:15,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 284 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 23:45:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-02-20 23:45:15,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:15,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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:45:15,741 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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:45:15,742 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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:45:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,743 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:45:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-02-20 23:45:15,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:15,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:15,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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:45:15,744 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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:45:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:15,745 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-02-20 23:45:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-02-20 23:45:15,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:15,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:15,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:15,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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:45:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-02-20 23:45:15,748 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2022-02-20 23:45:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:15,748 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-02-20 23:45:15,748 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:45:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-02-20 23:45:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:45:15,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:15,749 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:45:15,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:45:15,749 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015976, now seen corresponding path program 1 times [2022-02-20 23:45:15,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:15,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205238678] [2022-02-20 23:45:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:15,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {1669#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(14, 2); {1669#true} is VALID [2022-02-20 23:45:15,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1669#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {1669#true} is VALID [2022-02-20 23:45:15,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1669#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1671#(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:45:15,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {1671#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1671#(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:45:15,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {1671#(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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {1671#(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:45:15,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#(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~mem4#1.base, append_#t~mem4#1.offset; {1671#(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:45:15,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#(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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {1671#(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:45:15,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#(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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {1671#(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:45:15,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#(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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {1672#(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:45:15,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1672#(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~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {1672#(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:45:15,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {1672#(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: L535 {1673#(= (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:45:15,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {1673#(= (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; {1673#(= (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:45:15,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {1673#(= (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~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1673#(= (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:45:15,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {1673#(= (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~nondet10#1);havoc main_#t~nondet10#1; {1673#(= (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:45:15,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {1673#(= (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~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {1673#(= (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:45:15,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {1673#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1673#(= (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:45:15,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {1673#(= (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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {1674#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} is VALID [2022-02-20 23:45:15,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1674#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} assume !(1 == #valid[main_#t~mem12#1.base]); {1670#false} is VALID [2022-02-20 23:45:15,823 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:45:15,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:15,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205238678] [2022-02-20 23:45:15,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205238678] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:15,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:15,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:15,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516738175] [2022-02-20 23:45:15,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:15,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:15,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:15,837 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:45:15,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:15,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:15,838 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,088 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:45:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:16,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-02-20 23:45:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-02-20 23:45:16,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2022-02-20 23:45:16,149 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:45:16,150 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:45:16,150 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:45:16,150 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:45:16,150 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 135 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:16,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 74 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:45:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-02-20 23:45:16,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:16,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 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:45:16,153 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 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:45:16,153 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 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:45:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,155 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:45:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:45:16,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:16,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:16,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 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 79 states. [2022-02-20 23:45:16,155 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 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 79 states. [2022-02-20 23:45:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,157 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-02-20 23:45:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:45:16,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:16,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:16,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:16,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 69 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:45:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-02-20 23:45:16,159 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 18 [2022-02-20 23:45:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:16,159 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-02-20 23:45:16,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-02-20 23:45:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:45:16,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:16,159 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:45:16,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:45:16,160 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015977, now seen corresponding path program 1 times [2022-02-20 23:45:16,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:16,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480276148] [2022-02-20 23:45:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:16,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {1988#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(14, 2); {1988#true} is VALID [2022-02-20 23:45:16,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {1988#true} is VALID [2022-02-20 23:45:16,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1988#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1990#(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:45:16,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {1990#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1990#(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:45:16,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {1990#(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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {1990#(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:45:16,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1990#(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~mem4#1.base, append_#t~mem4#1.offset; {1990#(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:45:16,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {1990#(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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {1990#(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:45:16,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1990#(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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {1990#(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:45:16,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {1990#(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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {1991#(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:45:16,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {1991#(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~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {1991#(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:45:16,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {1991#(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: L535 {1992#(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:45:16,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#(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; {1992#(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:45:16,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {1992#(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~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1992#(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:45:16,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1992#(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~nondet10#1);havoc main_#t~nondet10#1; {1992#(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:45:16,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1992#(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~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {1992#(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:45:16,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1992#(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_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1992#(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:45:16,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {1992#(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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {1993#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|)) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:45:16,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {1993#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|)) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} assume !(4 + main_#t~mem12#1.offset <= #length[main_#t~mem12#1.base] && 0 <= main_#t~mem12#1.offset); {1989#false} is VALID [2022-02-20 23:45:16,359 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:45:16,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:16,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480276148] [2022-02-20 23:45:16,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480276148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:16,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:16,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:16,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989083063] [2022-02-20 23:45:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:16,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:16,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,379 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:45:16,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:16,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:16,380 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,640 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-02-20 23:45:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:16,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-02-20 23:45:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-02-20 23:45:16,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2022-02-20 23:45:16,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:16,709 INFO L225 Difference]: With dead ends: 81 [2022-02-20 23:45:16,709 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 23:45:16,709 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:45:16,710 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 167 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:16,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 78 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 23:45:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-02-20 23:45:16,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:16,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 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:45:16,712 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 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:45:16,712 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 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:45:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,713 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-02-20 23:45:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-02-20 23:45:16,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:16,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:16,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 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 81 states. [2022-02-20 23:45:16,714 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 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 81 states. [2022-02-20 23:45:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,715 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-02-20 23:45:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-02-20 23:45:16,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:16,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:16,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:16,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 68 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:45:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-02-20 23:45:16,717 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 18 [2022-02-20 23:45:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:16,717 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-02-20 23:45:16,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 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:45:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-02-20 23:45:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:45:16,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:16,718 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:45:16,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:45:16,718 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1245694816, now seen corresponding path program 1 times [2022-02-20 23:45:16,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:16,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214860249] [2022-02-20 23:45:16,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:16,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:16,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {2312#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(14, 2); {2312#true} is VALID [2022-02-20 23:45:16,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {2312#true} is VALID [2022-02-20 23:45:16,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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~mem4#1.base, append_#t~mem4#1.offset; {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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:45:16,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {2314#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 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: L535 {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:16,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:16,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:16,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:16,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {2315#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {2316#(not (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} is VALID [2022-02-20 23:45:16,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {2316#(not (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} assume !(main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {2313#false} is VALID [2022-02-20 23:45:16,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {2313#false} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L551-1 {2313#false} is VALID [2022-02-20 23:45:16,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} assume !(main_#t~mem18#1.base != 0 || main_#t~mem18#1.offset != 0);havoc main_#t~mem18#1.base, main_#t~mem18#1.offset; {2313#false} is VALID [2022-02-20 23:45:16,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#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; {2313#false} is VALID [2022-02-20 23:45:16,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !(#valid == main_old_#valid#1); {2313#false} is VALID [2022-02-20 23:45:16,819 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:45:16,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:16,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214860249] [2022-02-20 23:45:16,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214860249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:16,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:16,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:16,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358664132] [2022-02-20 23:45:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.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:45:16,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:16,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.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:45:16,834 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:45:16,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:16,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:16,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:16,835 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.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:45:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,013 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-02-20 23:45:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:17,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.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:45:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.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:45:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 23:45:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.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:45:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 23:45:17,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 23:45:17,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:17,102 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:45:17,102 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 23:45:17,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:17,103 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:17,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 91 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 23:45:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 23:45:17,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:17,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 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:45:17,105 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 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:45:17,105 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 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:45:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,106 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-02-20 23:45:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-02-20 23:45:17,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 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 63 states. [2022-02-20 23:45:17,109 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 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 63 states. [2022-02-20 23:45:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,109 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-02-20 23:45:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-02-20 23:45:17,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:17,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 62 states have internal predecessors, (65), 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:45:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-02-20 23:45:17,111 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 20 [2022-02-20 23:45:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:17,111 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-02-20 23:45:17,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.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:45:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-02-20 23:45:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:17,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:17,112 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:45:17,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:45:17,112 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash -663319495, now seen corresponding path program 1 times [2022-02-20 23:45:17,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:17,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130143022] [2022-02-20 23:45:17,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {2575#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(14, 2); {2575#true} is VALID [2022-02-20 23:45:17,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {2575#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {2575#true} is VALID [2022-02-20 23:45:17,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {2575#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2577#(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:45:17,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {2577#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {2577#(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:45:17,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {2577#(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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {2577#(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:45:17,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {2577#(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~mem4#1.base, append_#t~mem4#1.offset; {2577#(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:45:17,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {2577#(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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {2577#(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:45:17,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {2577#(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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2577#(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:45:17,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {2577#(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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {2577#(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:45:17,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {2577#(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;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2577#(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:45:17,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {2577#(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_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {2578#(= (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:45:17,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {2578#(= (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; {2578#(= (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:45:17,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {2578#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {2578#(= (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:45:17,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {2578#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2578#(= (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:45:17,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {2578#(= (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~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {2578#(= (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:45:17,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {2578#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {2578#(= (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:45:17,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {2578#(= (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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {2578#(= (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:45:17,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {2578#(= (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_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {2578#(= (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:45:17,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {2578#(= (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~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {2578#(= (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:45:17,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {2578#(= (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {2579#(= 0 |ULTIMATE.start_main_#t~mem14#1.offset|)} is VALID [2022-02-20 23:45:17,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {2579#(= 0 |ULTIMATE.start_main_#t~mem14#1.offset|)} assume !(0 == main_#t~mem14#1.offset); {2576#false} is VALID [2022-02-20 23:45:17,198 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:45:17,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130143022] [2022-02-20 23:45:17,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130143022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:17,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:17,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:17,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173911306] [2022-02-20 23:45:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:17,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:17,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,213 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:45:17,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:17,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:17,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:17,214 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,364 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-02-20 23:45:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:17,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-02-20 23:45:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-02-20 23:45:17,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-02-20 23:45:17,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:17,408 INFO L225 Difference]: With dead ends: 62 [2022-02-20 23:45:17,408 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 23:45:17,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:17,409 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 60 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:17,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 23:45:17,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-20 23:45:17,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:17,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 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:45:17,411 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 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:45:17,411 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 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:45:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,412 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-02-20 23:45:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-02-20 23:45:17,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 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 62 states. [2022-02-20 23:45:17,413 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 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 62 states. [2022-02-20 23:45:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,414 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-02-20 23:45:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-02-20 23:45:17,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:17,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 61 states have internal predecessors, (64), 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:45:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-02-20 23:45:17,415 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 21 [2022-02-20 23:45:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:17,415 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-02-20 23:45:17,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:45:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-02-20 23:45:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:17,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:17,416 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:45:17,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:45:17,416 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 911932233, now seen corresponding path program 1 times [2022-02-20 23:45:17,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:17,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546429036] [2022-02-20 23:45:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {2834#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(14, 2); {2834#true} is VALID [2022-02-20 23:45:17,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2834#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {2834#true} is VALID [2022-02-20 23:45:17,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {2834#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,466 INFO L290 TraceCheckUtils]: 3: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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~mem4#1.base, append_#t~mem4#1.offset; {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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:45:17,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {2836#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |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: L535 {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume { :end_inline_append } true; {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {2837#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {2838#(<= (+ |ULTIMATE.start_main_#t~mem14#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {2838#(<= (+ |ULTIMATE.start_main_#t~mem14#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem14#1.offset; {2838#(<= (+ |ULTIMATE.start_main_#t~mem14#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:17,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {2838#(<= (+ |ULTIMATE.start_main_#t~mem14#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem14#1.base < #StackHeapBarrier); {2835#false} is VALID [2022-02-20 23:45:17,474 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:45:17,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546429036] [2022-02-20 23:45:17,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546429036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:17,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:17,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:17,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265527082] [2022-02-20 23:45:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:17,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:17,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,491 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:45:17,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:17,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:17,491 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,684 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-02-20 23:45:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:17,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 23:45:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 23:45:17,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-20 23:45:17,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:17,732 INFO L225 Difference]: With dead ends: 61 [2022-02-20 23:45:17,732 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 23:45:17,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:17,733 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:17,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 69 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 23:45:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-20 23:45:17,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:17,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:17,735 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:17,735 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,736 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-02-20 23:45:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-02-20 23:45:17,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states. [2022-02-20 23:45:17,736 INFO L87 Difference]: Start difference. First operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states. [2022-02-20 23:45:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,737 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-02-20 23:45:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-02-20 23:45:17,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:17,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-02-20 23:45:17,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 22 [2022-02-20 23:45:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:17,739 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-02-20 23:45:17,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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:45:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-02-20 23:45:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:17,739 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:17,740 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:45:17,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:45:17,740 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2022-02-20 23:45:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2022-02-20 23:45:17,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:17,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941281880] [2022-02-20 23:45:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:17,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {3089#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(14, 2); {3089#true} is VALID [2022-02-20 23:45:17,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {3089#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {3089#true} is VALID [2022-02-20 23:45:17,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {3089#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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3091#(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:45:17,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {3091#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {3091#(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:45:17,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {3091#(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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {3091#(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:45:17,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {3091#(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~mem4#1.base, append_#t~mem4#1.offset; {3091#(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:45:17,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {3091#(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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {3091#(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:45:17,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {3091#(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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3091#(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:45:17,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {3091#(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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {3092#(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:45:17,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {3092#(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~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3092#(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:45:17,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {3092#(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: L535 {3093#(= (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:45:17,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {3093#(= (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; {3093#(= (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:45:17,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {3093#(= (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~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {3093#(= (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:45:17,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {3093#(= (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~nondet10#1);havoc main_#t~nondet10#1; {3093#(= (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:45:17,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {3093#(= (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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3094#(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:45:17,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {3094#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {3095#(or (= (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_append_#t~mem4#1.base|))} is VALID [2022-02-20 23:45:17,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {3095#(or (= (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_append_#t~mem4#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {3096#(= (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:45:17,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {3096#(= (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~mem4#1.base, append_#t~mem4#1.offset; {3096#(= (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:45:17,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {3096#(= (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~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {3096#(= (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:45:17,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {3096#(= (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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {3096#(= (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:45:17,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {3096#(= (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: L533 {3097#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:45:17,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {3097#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} assume !(1 == #valid[append_#t~mem6#1.base]); {3090#false} is VALID [2022-02-20 23:45:17,833 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:45:17,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941281880] [2022-02-20 23:45:17,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941281880] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:17,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399527232] [2022-02-20 23:45:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:17,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:17,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:17,848 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:45:17,849 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:45:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 23:45:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:18,097 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:45:18,193 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-02-20 23:45:18,193 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:45:18,283 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:18,284 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:45:18,432 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:45:18,433 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:45:18,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {3089#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(14, 2); {3089#true} is VALID [2022-02-20 23:45:18,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {3089#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#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_~next~1#1.base, main_~next~1#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;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); {3104#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:18,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {3104#(= |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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3108#(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:45:18,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {3108#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {3108#(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:45:18,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {3108#(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~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {3108#(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:45:18,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {3108#(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~mem4#1.base, append_#t~mem4#1.offset; {3108#(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:45:18,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {3108#(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_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {3108#(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:45:18,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {3108#(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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3108#(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:45:18,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {3108#(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~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {3127#(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:45:18,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {3127#(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~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3127#(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:45:18,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {3127#(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: L535 {3134#(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:45:18,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {3134#(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; {3134#(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:45:18,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#(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~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {3134#(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:45:18,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {3134#(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~nondet10#1);havoc main_#t~nondet10#1; {3134#(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:45:18,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {3134#(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~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#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;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3147#(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:45:18,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {3147#(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~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {3151#(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~mem4#1.base|)))} is VALID [2022-02-20 23:45:18,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {3151#(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~mem4#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {3155#(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:45:18,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {3155#(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~mem4#1.base, append_#t~mem4#1.offset; {3155#(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:45:18,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {3155#(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~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {3155#(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:45:18,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {3155#(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~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {3155#(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:45:18,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {3155#(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: L533 {3097#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:45:18,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {3097#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} assume !(1 == #valid[append_#t~mem6#1.base]); {3090#false} is VALID [2022-02-20 23:45:18,454 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:45:18,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:18,695 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