./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:07,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:07,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:07,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:07,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:07,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:07,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:07,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:07,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:07,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:07,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:07,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:07,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:07,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:07,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:07,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:07,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:07,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:07,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:07,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:07,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:07,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:07,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:07,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:07,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:07,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:07,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:07,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:07,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:07,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:07,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:07,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:07,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:07,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:07,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:07,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:07,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:07,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:07,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:07,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:07,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:07,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:48:07,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:07,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:07,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:07,369 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:07,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:07,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:07,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:07,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:07,370 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:07,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:07,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:07,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:07,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:07,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:07,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:07,372 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:07,372 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:07,372 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:07,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:07,373 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:07,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:07,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:07,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:07,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:07,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:07,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:07,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:07,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:07,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:07,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:07,377 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 -> 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb [2022-02-20 23:48:07,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:07,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:07,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:07,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:07,633 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:07,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_2.i [2022-02-20 23:48:07,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26521f5c/fa7f20f9cfde4ceca6902d2a60f80fa2/FLAGe14e79081 [2022-02-20 23:48:08,096 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:08,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i [2022-02-20 23:48:08,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26521f5c/fa7f20f9cfde4ceca6902d2a60f80fa2/FLAGe14e79081 [2022-02-20 23:48:08,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26521f5c/fa7f20f9cfde4ceca6902d2a60f80fa2 [2022-02-20 23:48:08,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:08,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:08,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:08,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:08,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:08,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0a5b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08, skipping insertion in model container [2022-02-20 23:48:08,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:08,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:08,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i[23625,23638] [2022-02-20 23:48:08,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:08,566 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:08,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i[23625,23638] [2022-02-20 23:48:08,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:08,629 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:08,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08 WrapperNode [2022-02-20 23:48:08,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:08,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:08,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:08,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:08,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,676 INFO L137 Inliner]: procedures = 125, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2022-02-20 23:48:08,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:08,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:08,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:08,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:08,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:08,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:08,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:08,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:08,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (1/1) ... [2022-02-20 23:48:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:08,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:08,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:48:08,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:48:08,803 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:48:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:48:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:48:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:48:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:08,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:08,875 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:08,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:08,893 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:48:09,284 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:09,298 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:09,298 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:48:09,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:09 BoogieIcfgContainer [2022-02-20 23:48:09,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:09,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:09,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:09,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:09,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:08" (1/3) ... [2022-02-20 23:48:09,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d9d293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:09, skipping insertion in model container [2022-02-20 23:48:09,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:08" (2/3) ... [2022-02-20 23:48:09,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d9d293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:09, skipping insertion in model container [2022-02-20 23:48:09,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:09" (3/3) ... [2022-02-20 23:48:09,321 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_2.i [2022-02-20 23:48:09,329 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:09,329 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-02-20 23:48:09,375 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:09,382 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:48:09,383 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-02-20 23:48:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 91 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:48:09,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:09,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:09,409 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:09,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2022-02-20 23:48:09,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:09,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921034773] [2022-02-20 23:48:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:09,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#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(13, 2); {96#true} is VALID [2022-02-20 23:48:09,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~post11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~nondet9#1, main_#t~short10#1, main_#t~nondet14#1, main_#t~post16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem15#1, main_#t~post19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem18#1, main_#t~mem21#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0;main_~y~0#1 := 0;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {96#true} is VALID [2022-02-20 23:48:09,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {96#true} is VALID [2022-02-20 23:48:09,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {96#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {96#true} is VALID [2022-02-20 23:48:09,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {96#true} assume !true; {97#false} is VALID [2022-02-20 23:48:09,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {97#false} assume !true; {97#false} is VALID [2022-02-20 23:48:09,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#false} assume !(1 == #valid[main_~p~0#1.base]); {97#false} is VALID [2022-02-20 23:48:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:09,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:09,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921034773] [2022-02-20 23:48:09,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921034773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:09,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:09,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:09,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327338644] [2022-02-20 23:48:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:48:09,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:09,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:09,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:48:09,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:48:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:09,654 INFO L87 Difference]: Start difference. First operand has 93 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 91 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:09,755 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-20 23:48:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:48:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:48:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2022-02-20 23:48:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2022-02-20 23:48:09,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 108 transitions. [2022-02-20 23:48:09,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:09,886 INFO L225 Difference]: With dead ends: 93 [2022-02-20 23:48:09,886 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:48:09,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:09,893 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:09,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:48:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-20 23:48:09,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:09,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,931 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,933 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:09,941 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-02-20 23:48:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:48:09,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:09,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:09,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-20 23:48:09,943 INFO L87 Difference]: Start difference. First operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-20 23:48:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:09,954 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-02-20 23:48:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:48:09,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:09,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:09,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:09,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.9166666666666667) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-02-20 23:48:09,964 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2022-02-20 23:48:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:09,965 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-02-20 23:48:09,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-02-20 23:48:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:09,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:09,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:09,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:09,967 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2022-02-20 23:48:09,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:09,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203924841] [2022-02-20 23:48:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:10,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#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(13, 2); {451#true} is VALID [2022-02-20 23:48:10,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~post11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~nondet9#1, main_#t~short10#1, main_#t~nondet14#1, main_#t~post16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem15#1, main_#t~post19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem18#1, main_#t~mem21#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0;main_~y~0#1 := 0;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {453#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:48:10,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {453#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:48:10,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {453#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:10,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} main_#t~short5#1 := main_~i~0#1 < 10; {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:10,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:10,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:10,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {452#false} is VALID [2022-02-20 23:48:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:10,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:10,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203924841] [2022-02-20 23:48:10,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203924841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:10,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:10,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:10,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27020620] [2022-02-20 23:48:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:10,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:10,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:10,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:10,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:10,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:10,090 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:10,346 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-02-20 23:48:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:10,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-02-20 23:48:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-02-20 23:48:10,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 138 transitions. [2022-02-20 23:48:10,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:10,486 INFO L225 Difference]: With dead ends: 107 [2022-02-20 23:48:10,486 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 23:48:10,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:10,488 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 160 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:10,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 52 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 23:48:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2022-02-20 23:48:10,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:10,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,499 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,499 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:10,505 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-02-20 23:48:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-02-20 23:48:10,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:10,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:10,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 states. [2022-02-20 23:48:10,512 INFO L87 Difference]: Start difference. First operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 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 107 states. [2022-02-20 23:48:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:10,515 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2022-02-20 23:48:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-02-20 23:48:10,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:10,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:10,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:10,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-02-20 23:48:10,521 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 8 [2022-02-20 23:48:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:10,522 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-02-20 23:48:10,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-02-20 23:48:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:10,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:10,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:10,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:10,524 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2022-02-20 23:48:10,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:10,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747457514] [2022-02-20 23:48:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:10,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {867#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(13, 2); {867#true} is VALID [2022-02-20 23:48:10,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~post11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~nondet9#1, main_#t~short10#1, main_#t~nondet14#1, main_#t~post16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem15#1, main_#t~post19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem18#1, main_#t~mem21#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0;main_~y~0#1 := 0;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {869#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} is VALID [2022-02-20 23:48:10,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {869#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {869#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} is VALID [2022-02-20 23:48:10,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {869#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:10,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~short5#1 := main_~i~0#1 < 10; {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:10,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:10,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:10,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {868#false} is VALID [2022-02-20 23:48:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:10,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:10,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747457514] [2022-02-20 23:48:10,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747457514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:10,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:10,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:10,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999504304] [2022-02-20 23:48:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:10,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:10,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:10,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:10,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:10,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:10,667 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:11,010 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-02-20 23:48:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:11,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-02-20 23:48:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2022-02-20 23:48:11,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 152 transitions. [2022-02-20 23:48:11,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:11,163 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:48:11,163 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:48:11,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:11,165 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 167 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:11,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 60 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:48:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2022-02-20 23:48:11,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:11,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,171 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,171 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:11,175 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-02-20 23:48:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-02-20 23:48:11,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:11,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:11,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 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 124 states. [2022-02-20 23:48:11,176 INFO L87 Difference]: Start difference. First operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 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 124 states. [2022-02-20 23:48:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:11,180 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-02-20 23:48:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-02-20 23:48:11,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:11,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:11,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:11,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-02-20 23:48:11,184 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 8 [2022-02-20 23:48:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:11,185 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-02-20 23:48:11,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-02-20 23:48:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:11,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:11,186 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:11,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:11,186 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2022-02-20 23:48:11,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:11,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763800532] [2022-02-20 23:48:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:11,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {1354#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(13, 2); {1354#true} is VALID [2022-02-20 23:48:11,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~post11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~nondet9#1, main_#t~short10#1, main_#t~nondet14#1, main_#t~post16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem15#1, main_#t~post19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem18#1, main_#t~mem21#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0;main_~y~0#1 := 0;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1354#true} is VALID [2022-02-20 23:48:11,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1354#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1354#true} is VALID [2022-02-20 23:48:11,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {1354#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1354#true} is VALID [2022-02-20 23:48:11,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {1354#true} main_#t~short5#1 := main_~i~0#1 < 10; {1354#true} is VALID [2022-02-20 23:48:11,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {1354#true} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {1354#true} is VALID [2022-02-20 23:48:11,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {1354#true} assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1354#true} is VALID [2022-02-20 23:48:11,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1354#true} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L541 {1354#true} is VALID [2022-02-20 23:48:11,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1354#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {1356#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} is VALID [2022-02-20 23:48:11,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); {1356#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} is VALID [2022-02-20 23:48:11,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L543-3 {1357#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:48:11,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {1357#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {1358#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:48:11,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {1358#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:11,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} main_#t~short5#1 := main_~i~0#1 < 10; {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:11,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:11,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:48:11,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1359#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {1355#false} is VALID [2022-02-20 23:48:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:11,266 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:11,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763800532] [2022-02-20 23:48:11,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763800532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:11,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:11,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:11,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116939682] [2022-02-20 23:48:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:11,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:48:11,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:11,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:11,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:11,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:11,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:11,283 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:11,881 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-02-20 23:48:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:48:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-02-20 23:48:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-02-20 23:48:11,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 144 transitions. [2022-02-20 23:48:11,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:12,000 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:48:12,000 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:48:12,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:12,001 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 115 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:12,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 240 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:48:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2022-02-20 23:48:12,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:12,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,007 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,008 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:12,011 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-02-20 23:48:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2022-02-20 23:48:12,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:12,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:12,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:48:12,013 INFO L87 Difference]: Start difference. First operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 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 152 states. [2022-02-20 23:48:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:12,016 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-02-20 23:48:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2022-02-20 23:48:12,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:12,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:12,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:12,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2022-02-20 23:48:12,020 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 17 [2022-02-20 23:48:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:12,021 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2022-02-20 23:48:12,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-02-20 23:48:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:12,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:12,022 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:12,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:12,022 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2022-02-20 23:48:12,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:12,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498495635] [2022-02-20 23:48:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:12,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {1936#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(13, 2); {1936#true} is VALID [2022-02-20 23:48:12,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~post11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~nondet9#1, main_#t~short10#1, main_#t~nondet14#1, main_#t~post16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem15#1, main_#t~post19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem18#1, main_#t~mem21#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0;main_~y~0#1 := 0;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1936#true} is VALID [2022-02-20 23:48:12,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {1936#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {1936#true} is VALID [2022-02-20 23:48:12,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {1936#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1936#true} is VALID [2022-02-20 23:48:12,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {1936#true} main_#t~short5#1 := main_~i~0#1 < 10; {1936#true} is VALID [2022-02-20 23:48:12,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1936#true} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {1936#true} is VALID [2022-02-20 23:48:12,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {1936#true} assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1936#true} is VALID [2022-02-20 23:48:12,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L541 {1936#true} is VALID [2022-02-20 23:48:12,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {1938#(and (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) 8) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} is VALID [2022-02-20 23:48:12,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#(and (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) 8) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} assume !(main_~t~0#1.base == 0 && main_~t~0#1.offset == 0); {1938#(and (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) 8) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} is VALID [2022-02-20 23:48:12,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#(and (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) 8) (= |ULTIMATE.start_main_~t~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L543-3 {1939#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) 8))} is VALID [2022-02-20 23:48:12,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {1939#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4))) 8))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L544 {1940#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 8))} is VALID [2022-02-20 23:48:12,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {1940#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 8))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:12,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~short5#1 := main_~i~0#1 < 10; {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:12,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:12,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1;main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:48:12,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {1941#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {1937#false} is VALID [2022-02-20 23:48:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:12,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:12,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498495635] [2022-02-20 23:48:12,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498495635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:12,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:12,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:12,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074337298] [2022-02-20 23:48:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:48:12,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:12,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:12,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:12,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:12,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:12,140 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:12,881 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-02-20 23:48:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:48:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-02-20 23:48:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-02-20 23:48:12,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 152 transitions. [2022-02-20 23:48:13,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:13,009 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:48:13,009 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:48:13,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:13,011 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 79 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:13,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 307 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:48:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2022-02-20 23:48:13,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:13,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,016 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,016 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,020 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-02-20 23:48:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2022-02-20 23:48:13,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:13,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:13,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:48:13,021 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 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 155 states. [2022-02-20 23:48:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,024 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-02-20 23:48:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2022-02-20 23:48:13,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:13,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:13,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:13,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-02-20 23:48:13,027 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 17 [2022-02-20 23:48:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:13,028 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-02-20 23:48:13,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-02-20 23:48:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:48:13,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:13,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:13,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:13,029 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -808483032, now seen corresponding path program 1 times [2022-02-20 23:48:13,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:13,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764944550] [2022-02-20 23:48:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:13,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {2515#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(13, 2); {2515#true} is VALID [2022-02-20 23:48:13,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {2515#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet4#1, main_#t~short5#1, main_#t~post11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~nondet9#1, main_#t~short10#1, main_#t~nondet14#1, main_#t~post16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem15#1, main_#t~post19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem18#1, main_#t~mem21#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0;main_~y~0#1 := 0;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2515#true} is VALID [2022-02-20 23:48:13,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {2515#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {2515#true} is VALID [2022-02-20 23:48:13,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {2515#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} main_#t~short5#1 := main_~i~0#1 < 10; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume main_#t~short5#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_#t~short5#1 := 0 != main_#t~nondet4#1; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume !main_#t~short5#1;havoc main_#t~nondet4#1;havoc main_#t~short5#1; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} main_#t~short10#1 := main_~y~0#1 < 10; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume main_#t~short10#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_#t~short10#1 := 0 != main_#t~nondet9#1; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume !main_#t~short10#1;havoc main_#t~nondet9#1;havoc main_#t~short10#1; {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {2517#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L547-5 {2518#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:13,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {2518#(and (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~$Pointer$(0, (if main_#t~nondet14#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet14#1 % 4294967296 % 4294967296 else main_#t~nondet14#1 % 4294967296 % 4294967296 - 4294967296), main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L555 {2519#(= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 3)} is VALID [2022-02-20 23:48:13,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {2519#(= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 3)} havoc main_#t~nondet14#1;main_~i~0#1 := 0;main_~y~0#1 := 0;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {2520#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:48:13,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {2520#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call main_#t~mem15#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L560-3 {2521#(= 3 |ULTIMATE.start_main_#t~mem15#1|)} is VALID [2022-02-20 23:48:13,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {2521#(= 3 |ULTIMATE.start_main_#t~mem15#1|)} assume !!(1 == main_#t~mem15#1);havoc main_#t~mem15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2516#false} is VALID [2022-02-20 23:48:13,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {2516#false} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~p~0#1.base, 4 + main_~p~0#1.offset, 4); srcloc: L562 {2516#false} is VALID [2022-02-20 23:48:13,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#false} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset; {2516#false} is VALID [2022-02-20 23:48:13,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {2516#false} assume !(1 == #valid[main_~p~0#1.base]); {2516#false} is VALID [2022-02-20 23:48:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:13,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:13,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764944550] [2022-02-20 23:48:13,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764944550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:13,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:13,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:13,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430044954] [2022-02-20 23:48:13,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:13,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:13,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:13,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:13,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:13,154 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,645 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-02-20 23:48:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:48:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 23:48:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 23:48:13,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 191 transitions. [2022-02-20 23:48:13,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:13,800 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:48:13,800 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:48:13,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:13,801 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 118 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:13,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 231 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:48:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2022-02-20 23:48:13,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:13,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,807 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,808 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,811 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-02-20 23:48:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-02-20 23:48:13,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:13,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:13,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:48:13,813 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:48:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,817 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-02-20 23:48:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-02-20 23:48:13,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:13,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:13,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:13,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 105 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2022-02-20 23:48:13,820 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 18 [2022-02-20 23:48:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:13,821 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2022-02-20 23:48:13,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2022-02-20 23:48:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:13,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:13,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:13,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:13,822 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash 389256394, now seen corresponding path program 1 times [2022-02-20 23:48:13,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:13,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164407919] [2022-02-20 23:48:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:13,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:48:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:13,885 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:48:13,886 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:48:13,887 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2022-02-20 23:48:13,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (36 of 38 remaining) [2022-02-20 23:48:13,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (35 of 38 remaining) [2022-02-20 23:48:13,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (34 of 38 remaining) [2022-02-20 23:48:13,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (33 of 38 remaining) [2022-02-20 23:48:13,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (32 of 38 remaining) [2022-02-20 23:48:13,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (31 of 38 remaining) [2022-02-20 23:48:13,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (30 of 38 remaining) [2022-02-20 23:48:13,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (29 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (28 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (27 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (26 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (25 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (24 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (23 of 38 remaining) [2022-02-20 23:48:13,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (22 of 38 remaining) [2022-02-20 23:48:13,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (21 of 38 remaining) [2022-02-20 23:48:13,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (20 of 38 remaining) [2022-02-20 23:48:13,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (19 of 38 remaining) [2022-02-20 23:48:13,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (18 of 38 remaining) [2022-02-20 23:48:13,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (17 of 38 remaining) [2022-02-20 23:48:13,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (16 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (15 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (14 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (13 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (12 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (11 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (10 of 38 remaining) [2022-02-20 23:48:13,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (9 of 38 remaining) [2022-02-20 23:48:13,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (8 of 38 remaining) [2022-02-20 23:48:13,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (7 of 38 remaining) [2022-02-20 23:48:13,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2022-02-20 23:48:13,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2022-02-20 23:48:13,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2022-02-20 23:48:13,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2022-02-20 23:48:13,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2022-02-20 23:48:13,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2022-02-20 23:48:13,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-02-20 23:48:13,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:48:13,897 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:13,899 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:48:13,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:48:13 BoogieIcfgContainer [2022-02-20 23:48:13,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:48:13,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:48:13,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:48:13,923 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:48:13,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:09" (3/4) ... [2022-02-20 23:48:13,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:48:13,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:48:13,926 INFO L158 Benchmark]: Toolchain (without parser) took 5799.08ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 43.0MB in the beginning and 51.1MB in the end (delta: -8.0MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:13,927 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:13,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.11ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 42.9MB in the beginning and 64.0MB in the end (delta: -21.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:48:13,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 61.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:13,927 INFO L158 Benchmark]: Boogie Preprocessor took 54.60ms. Allocated memory is still 96.5MB. Free memory was 61.6MB in the beginning and 59.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:13,928 INFO L158 Benchmark]: RCFGBuilder took 578.41ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 73.7MB in the end (delta: -14.2MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-02-20 23:48:13,928 INFO L158 Benchmark]: TraceAbstraction took 4607.40ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 73.3MB in the beginning and 51.1MB in the end (delta: 22.2MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2022-02-20 23:48:13,928 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 117.4MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:13,930 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.11ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 42.9MB in the beginning and 64.0MB in the end (delta: -21.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 61.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.60ms. Allocated memory is still 96.5MB. Free memory was 61.6MB in the beginning and 59.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.41ms. Allocated memory is still 96.5MB. Free memory was 59.5MB in the beginning and 73.7MB in the end (delta: -14.2MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4607.40ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 73.3MB in the beginning and 51.1MB in the end (delta: 22.2MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 117.4MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 569]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 569. Possible FailurePath: [L533] int i = 0; [L534] int y = 0; [L535] List a = (List) malloc(sizeof(struct node)); [L536] COND FALSE !(a == 0) VAL [a={-1:0}, i=0, y=0] [L537] List t; [L538] List p = a; VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L539] i < 10 && __VERIFIER_nondet_int() [L539] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={-1:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, p={-1:0}, y=0] [L539] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L547] y < 10 && __VERIFIER_nondet_int() [L547] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={-1:0}, i=0, p={-1:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L547] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L555] p->h = 3 VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L556] p->n = (void*)__VERIFIER_nondet_ulong() VAL [__VERIFIER_nondet_ulong()=0, a={-1:0}, i=0, p={-1:0}, y=0] [L557] i = 0 [L558] y = 0 [L559] p = a VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L560] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, p->h=3, y=0] [L560] COND FALSE !(p->h == 1) [L564] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, p->h=3, y=0] [L564] COND FALSE !(p->h == 2) [L568] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, p->h=3, y=0] [L568] COND TRUE p->h != 3 || (i + y) < 20 [L569] reach_error() VAL [a={-1:0}, i=0, p={-1:0}, y=0] - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 587 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 405 mSDtfsCounter, 972 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:48:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:15,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:15,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:15,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:15,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:15,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:15,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:15,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:15,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:15,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:15,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:15,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:15,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:15,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:15,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:15,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:15,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:15,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:15,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:15,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:15,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:15,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:15,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:15,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:15,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:15,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:15,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:15,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:15,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:15,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:15,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:15,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:15,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:15,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:15,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:15,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:15,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:15,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:15,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:15,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:15,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:15,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:48:15,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:15,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:15,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:15,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:16,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:16,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:16,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:16,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:16,002 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:16,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:16,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:16,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:16,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:16,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:16,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:16,004 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:16,005 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:16,005 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:16,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:16,005 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:16,005 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:48:16,006 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:48:16,006 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:16,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:16,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:16,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:16,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:16,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:16,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:16,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:16,017 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:48:16,017 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:48:16,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:48:16,018 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 8708d72a830c5b897b9a667c6367e709c7302fa81ab6e6c80a90a68a6807b5fb [2022-02-20 23:48:16,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:16,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:16,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:16,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:16,371 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:16,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_2.i [2022-02-20 23:48:16,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b7fe72d/6b54fc6169b04c0c8991600e1bf7a1ee/FLAGfea045c72 [2022-02-20 23:48:16,890 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:16,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i [2022-02-20 23:48:16,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b7fe72d/6b54fc6169b04c0c8991600e1bf7a1ee/FLAGfea045c72 [2022-02-20 23:48:17,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b7fe72d/6b54fc6169b04c0c8991600e1bf7a1ee [2022-02-20 23:48:17,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:17,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:17,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:17,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:17,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:17,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c631d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17, skipping insertion in model container [2022-02-20 23:48:17,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:17,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:17,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i[23625,23638] [2022-02-20 23:48:17,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:17,765 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:17,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_2.i[23625,23638] [2022-02-20 23:48:17,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:17,876 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:17,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17 WrapperNode [2022-02-20 23:48:17,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:17,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:17,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:17,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:17,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,943 INFO L137 Inliner]: procedures = 128, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2022-02-20 23:48:17,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:17,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:17,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:17,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:17,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:17,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:17,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:17,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:17,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:17,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (1/1) ... [2022-02-20 23:48:18,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:18,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:18,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:48:18,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:48:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:48:18,065 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:48:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:48:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:18,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:48:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:48:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:18,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:18,151 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:18,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:18,203 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:48:18,752 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:18,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:18,761 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:48:18,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:18 BoogieIcfgContainer [2022-02-20 23:48:18,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:18,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:18,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:18,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:18,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:17" (1/3) ... [2022-02-20 23:48:18,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101e1046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:18, skipping insertion in model container [2022-02-20 23:48:18,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:17" (2/3) ... [2022-02-20 23:48:18,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101e1046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:18, skipping insertion in model container [2022-02-20 23:48:18,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:18" (3/3) ... [2022-02-20 23:48:18,773 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_2.i [2022-02-20 23:48:18,782 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:18,782 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-02-20 23:48:18,832 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:18,841 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:48:18,842 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-02-20 23:48:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 47 states have (on average 2.106382978723404) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:48:18,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:18,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:48:18,867 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516551, now seen corresponding path program 1 times [2022-02-20 23:48:18,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:18,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082738260] [2022-02-20 23:48:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:18,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:18,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:18,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:48:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:18,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:48:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:18,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:19,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:19,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {92#true} is VALID [2022-02-20 23:48:19,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {100#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:19,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {100#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:19,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {107#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:19,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !!(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {107#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:19,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~p~0#1.base]); {93#false} is VALID [2022-02-20 23:48:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:19,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:19,128 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:19,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082738260] [2022-02-20 23:48:19,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082738260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:19,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:19,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:19,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606891460] [2022-02-20 23:48:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:48:19,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:19,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:19,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:19,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:19,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:19,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:19,186 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 2.106382978723404) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:19,879 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-02-20 23:48:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:48:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2022-02-20 23:48:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2022-02-20 23:48:19,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 147 transitions. [2022-02-20 23:48:20,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:20,110 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:48:20,113 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:48:20,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:20,118 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 149 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:20,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 55 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:48:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-02-20 23:48:20,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:20,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:20,157 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:20,160 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:20,172 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-02-20 23:48:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-02-20 23:48:20,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:20,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:20,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:48:20,174 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 23:48:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:20,188 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-02-20 23:48:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-02-20 23:48:20,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:20,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:20,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:20,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.75) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-02-20 23:48:20,196 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 6 [2022-02-20 23:48:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:20,199 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-02-20 23:48:20,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-02-20 23:48:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:48:20,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:20,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:48:20,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:20,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:20,410 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516552, now seen corresponding path program 1 times [2022-02-20 23:48:20,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:20,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944986797] [2022-02-20 23:48:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:20,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:20,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:20,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:48:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:20,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:48:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:20,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:20,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:20,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {498#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {498#true} is VALID [2022-02-20 23:48:20,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {498#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {506#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:20,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {506#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:20,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {513#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:20,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {513#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !!(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {513#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:20,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~p~0#1.offset), #length[main_~p~0#1.base]) && ~bvule32(main_~p~0#1.offset, ~bvadd32(4bv32, main_~p~0#1.offset))) && ~bvule32(0bv32, main_~p~0#1.offset)); {499#false} is VALID [2022-02-20 23:48:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:20,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:20,535 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:20,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944986797] [2022-02-20 23:48:20,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944986797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:20,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:20,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:20,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120600373] [2022-02-20 23:48:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:20,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:48:20,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:20,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:20,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:20,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:20,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:20,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:20,547 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:21,263 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-02-20 23:48:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 23:48:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-02-20 23:48:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-02-20 23:48:21,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 140 transitions. [2022-02-20 23:48:21,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:21,470 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:48:21,470 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:48:21,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:21,472 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:21,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 48 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:48:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2022-02-20 23:48:21,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:21,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,478 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,478 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:21,482 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-02-20 23:48:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-02-20 23:48:21,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:21,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:21,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 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 116 states. [2022-02-20 23:48:21,484 INFO L87 Difference]: Start difference. First operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 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 116 states. [2022-02-20 23:48:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:21,487 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-02-20 23:48:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-02-20 23:48:21,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:21,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:21,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:21,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-02-20 23:48:21,492 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 6 [2022-02-20 23:48:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:21,492 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-02-20 23:48:21,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-02-20 23:48:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:48:21,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:21,493 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:21,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:21,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:21,702 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769667, now seen corresponding path program 1 times [2022-02-20 23:48:21,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:21,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432260454] [2022-02-20 23:48:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:21,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:21,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:48:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:21,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:48:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:21,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:21,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:21,845 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 13 treesize of output 9 [2022-02-20 23:48:21,878 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 21 treesize of output 9 [2022-02-20 23:48:21,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {968#true} is VALID [2022-02-20 23:48:21,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {968#true} is VALID [2022-02-20 23:48:21,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {968#true} is VALID [2022-02-20 23:48:21,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {968#true} is VALID [2022-02-20 23:48:21,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} assume !!(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {968#true} is VALID [2022-02-20 23:48:21,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#true} SUMMARY for call write~intINTTYPE4(1bv32, main_~p~0#1.base, main_~p~0#1.offset, 4bv32); srcloc: L541 {968#true} is VALID [2022-02-20 23:48:21,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#true} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {991#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:21,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {991#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} assume !(main_~t~0#1.base == 0bv32 && main_~t~0#1.offset == 0bv32); {991#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:21,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {991#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L543-3 {998#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:48:21,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {998#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|))) (_ bv1 1))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L544 {1002#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:21,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {1002#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) (_ bv1 1))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {1006#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:21,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !!(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {1006#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:21,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~p~0#1.base]); {969#false} is VALID [2022-02-20 23:48:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:21,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:21,915 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:21,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432260454] [2022-02-20 23:48:21,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432260454] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:21,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:21,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:21,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082865432] [2022-02-20 23:48:21,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:48:21,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:21,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:21,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:21,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:21,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:21,938 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:23,342 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-02-20 23:48:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:48:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-02-20 23:48:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-02-20 23:48:23,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2022-02-20 23:48:23,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:23,509 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:48:23,509 INFO L226 Difference]: Without dead ends: 142 [2022-02-20 23:48:23,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:23,510 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 105 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:23,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 180 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:48:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-20 23:48:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2022-02-20 23:48:23,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:23,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,517 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,517 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:23,520 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-02-20 23:48:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2022-02-20 23:48:23,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:23,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:23,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 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 142 states. [2022-02-20 23:48:23,522 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 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 142 states. [2022-02-20 23:48:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:23,526 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-02-20 23:48:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2022-02-20 23:48:23,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:23,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:23,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:23,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.52) internal successors, (114), 100 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-02-20 23:48:23,530 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 13 [2022-02-20 23:48:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:23,530 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-02-20 23:48:23,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-02-20 23:48:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:48:23,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:23,531 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:23,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:23,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:23,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769666, now seen corresponding path program 1 times [2022-02-20 23:48:23,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:23,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742524911] [2022-02-20 23:48:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:23,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:23,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:23,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:23,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:48:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:23,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:48:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:23,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:23,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:23,885 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 13 treesize of output 9 [2022-02-20 23:48:23,893 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 13 treesize of output 9 [2022-02-20 23:48:23,939 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 21 treesize of output 9 [2022-02-20 23:48:23,948 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 19 treesize of output 7 [2022-02-20 23:48:23,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {1546#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {1546#true} is VALID [2022-02-20 23:48:23,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1546#true} is VALID [2022-02-20 23:48:23,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1546#true} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {1546#true} is VALID [2022-02-20 23:48:23,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {1546#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {1546#true} is VALID [2022-02-20 23:48:23,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {1546#true} assume !!(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {1546#true} is VALID [2022-02-20 23:48:23,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1546#true} SUMMARY for call write~intINTTYPE4(1bv32, main_~p~0#1.base, main_~p~0#1.offset, 4bv32); srcloc: L541 {1546#true} is VALID [2022-02-20 23:48:23,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {1546#true} call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1569#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:48:23,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {1569#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} assume !(main_~t~0#1.base == 0bv32 && main_~t~0#1.offset == 0bv32); {1569#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:48:23,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {1569#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L543-3 {1576#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:48:23,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L544 {1580#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_#t~mem7#1.offset|))} is VALID [2022-02-20 23:48:23,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem7#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_#t~mem7#1.offset|))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {1584#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:23,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1584#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !!(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {1584#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:24,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {1584#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~p~0#1.offset), #length[main_~p~0#1.base]) && ~bvule32(main_~p~0#1.offset, ~bvadd32(4bv32, main_~p~0#1.offset))) && ~bvule32(0bv32, main_~p~0#1.offset)); {1547#false} is VALID [2022-02-20 23:48:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:24,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:24,001 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:24,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742524911] [2022-02-20 23:48:24,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742524911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:24,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:24,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:24,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43615840] [2022-02-20 23:48:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:48:24,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:24,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:24,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:24,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:24,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:24,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:24,018 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,611 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-02-20 23:48:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:25,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:48:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2022-02-20 23:48:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2022-02-20 23:48:25,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 137 transitions. [2022-02-20 23:48:25,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,794 INFO L225 Difference]: With dead ends: 145 [2022-02-20 23:48:25,794 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 23:48:25,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:25,795 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:25,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 247 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:48:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 23:48:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2022-02-20 23:48:25,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:25,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,800 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,800 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,805 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-02-20 23:48:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2022-02-20 23:48:25,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 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 145 states. [2022-02-20 23:48:25,807 INFO L87 Difference]: Start difference. First operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 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 145 states. [2022-02-20 23:48:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,811 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-02-20 23:48:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2022-02-20 23:48:25,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:25,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-02-20 23:48:25,814 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 13 [2022-02-20 23:48:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:25,814 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-02-20 23:48:25,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-02-20 23:48:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:25,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:25,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:26,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:26,024 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:26,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash 174166817, now seen corresponding path program 1 times [2022-02-20 23:48:26,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:26,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812632617] [2022-02-20 23:48:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:26,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:26,027 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:48:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:48:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:26,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:26,217 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:26,217 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 21 treesize of output 20 [2022-02-20 23:48:26,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:48:26,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {2125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {2125#true} is VALID [2022-02-20 23:48:26,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {2125#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2125#true} is VALID [2022-02-20 23:48:26,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {2125#true} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {2125#true} is VALID [2022-02-20 23:48:26,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {2125#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {2139#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:26,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {2139#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume !(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2139#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:26,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2139#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} assume !(~bvslt32(main_~y~0#1, 10bv32) && 0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {2139#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-20 23:48:26,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {2139#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~intINTTYPE4(3bv32, main_~p~0#1.base, main_~p~0#1.offset, 4bv32); srcloc: L547-2 {2149#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (_ bv3 32) (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:48:26,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {2149#(and (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_main_~a~0#1.offset|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (_ bv3 32) (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} SUMMARY for call write~$Pointer$(0bv32, main_#t~nondet12#1, main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L555 {2153#(= (_ bv3 32) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-20 23:48:26,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {2153#(= (_ bv3 32) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|))} havoc main_#t~nondet12#1;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {2157#(= (_ bv3 32) (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:48:26,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {2157#(= (_ bv3 32) (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call main_#t~mem13#1 := read~intINTTYPE4(main_~p~0#1.base, main_~p~0#1.offset, 4bv32); srcloc: L560-3 {2161#(= (_ bv3 32) |ULTIMATE.start_main_#t~mem13#1|)} is VALID [2022-02-20 23:48:26,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(= (_ bv3 32) |ULTIMATE.start_main_#t~mem13#1|)} assume !!(1bv32 == main_#t~mem13#1);havoc main_#t~mem13#1;main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post14#1);havoc main_#t~post14#1; {2126#false} is VALID [2022-02-20 23:48:26,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#false} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L562 {2126#false} is VALID [2022-02-20 23:48:26,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {2126#false} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {2126#false} is VALID [2022-02-20 23:48:26,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2126#false} assume !(1bv1 == #valid[main_~p~0#1.base]); {2126#false} is VALID [2022-02-20 23:48:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:26,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:26,282 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:26,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812632617] [2022-02-20 23:48:26,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812632617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:26,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:26,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:26,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058027125] [2022-02-20 23:48:26,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:26,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:26,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:26,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:26,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:26,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:26,305 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,319 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2022-02-20 23:48:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2022-02-20 23:48:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2022-02-20 23:48:27,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 179 transitions. [2022-02-20 23:48:27,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:27,528 INFO L225 Difference]: With dead ends: 177 [2022-02-20 23:48:27,528 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 23:48:27,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:27,529 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 138 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:27,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 176 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 23:48:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 96. [2022-02-20 23:48:27,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:27,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,541 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,541 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,545 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2022-02-20 23:48:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2022-02-20 23:48:27,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:27,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:27,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 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 177 states. [2022-02-20 23:48:27,546 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 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 177 states. [2022-02-20 23:48:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,554 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2022-02-20 23:48:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2022-02-20 23:48:27,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:27,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:27,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:27,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2022-02-20 23:48:27,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 14 [2022-02-20 23:48:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:27,558 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2022-02-20 23:48:27,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2022-02-20 23:48:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:27,558 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:27,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:27,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:27,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:27,766 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:27,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash 916718725, now seen corresponding path program 1 times [2022-02-20 23:48:27,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:27,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437637422] [2022-02-20 23:48:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:27,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:27,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:27,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:27,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:48:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:27,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:48:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:27,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:27,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:27,896 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 13 treesize of output 9 [2022-02-20 23:48:27,916 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 21 treesize of output 9 [2022-02-20 23:48:27,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {2802#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {2802#true} is VALID [2022-02-20 23:48:27,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {2802#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2802#true} is VALID [2022-02-20 23:48:27,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {2802#true} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {2802#true} is VALID [2022-02-20 23:48:27,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {2802#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {2802#true} is VALID [2022-02-20 23:48:27,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {2802#true} assume !(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2802#true} is VALID [2022-02-20 23:48:27,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {2802#true} assume !!(~bvslt32(main_~y~0#1, 10bv32) && 0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~y~0#1;main_~y~0#1 := ~bvadd32(1bv32, main_#t~post9#1);havoc main_#t~post9#1; {2802#true} is VALID [2022-02-20 23:48:27,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {2802#true} SUMMARY for call write~intINTTYPE4(2bv32, main_~p~0#1.base, main_~p~0#1.offset, 4bv32); srcloc: L549 {2802#true} is VALID [2022-02-20 23:48:27,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {2802#true} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(8bv32);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {2828#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:27,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {2828#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} assume !(main_~t~0#1.base == 0bv32 && main_~t~0#1.offset == 0bv32); {2828#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:27,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {2828#(= (select |#valid| |ULTIMATE.start_main_~t~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L551-3 {2835#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:48:27,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {2835#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|))) (_ bv1 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L552 {2839#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|))} is VALID [2022-02-20 23:48:27,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {2839#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {2843#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:27,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {2843#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !(~bvslt32(main_~y~0#1, 10bv32) && 0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {2843#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:27,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~p~0#1.base]); {2803#false} is VALID [2022-02-20 23:48:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:27,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:27,948 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:27,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437637422] [2022-02-20 23:48:27,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437637422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:27,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:27,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:27,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326888607] [2022-02-20 23:48:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:27,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:27,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:27,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:27,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:27,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:27,963 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,020 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-02-20 23:48:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 23:48:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 23:48:29,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-02-20 23:48:29,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,152 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:48:29,152 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:48:29,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:29,154 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 98 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:29,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 161 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:48:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2022-02-20 23:48:29,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:29,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,167 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,167 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,174 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-02-20 23:48:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-02-20 23:48:29,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 124 states. [2022-02-20 23:48:29,175 INFO L87 Difference]: Start difference. First operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 124 states. [2022-02-20 23:48:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,177 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-02-20 23:48:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2022-02-20 23:48:29,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:29,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 93 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2022-02-20 23:48:29,180 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 14 [2022-02-20 23:48:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:29,180 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2022-02-20 23:48:29,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2022-02-20 23:48:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:29,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:29,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:29,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:29,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:29,390 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 916718726, now seen corresponding path program 1 times [2022-02-20 23:48:29,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:29,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240745334] [2022-02-20 23:48:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:29,392 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:29,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:48:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:29,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:48:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:29,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:29,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:29,563 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 13 treesize of output 9 [2022-02-20 23:48:29,571 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 13 treesize of output 9 [2022-02-20 23:48:29,608 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 21 treesize of output 9 [2022-02-20 23:48:29,613 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 19 treesize of output 7 [2022-02-20 23:48:29,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {3322#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32); {3322#true} is VALID [2022-02-20 23:48:29,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {3322#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet4#1, main_#t~post9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet8#1, main_#t~nondet12#1, main_#t~post14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem13#1, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem16#1, main_#t~mem19#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~i~0#1, main_~y~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, main_~p~0#1.offset;main_~i~0#1 := 0bv32;main_~y~0#1 := 0bv32;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3322#true} is VALID [2022-02-20 23:48:29,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {3322#true} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {3322#true} is VALID [2022-02-20 23:48:29,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {3322#true} havoc main_~t~0#1.base, main_~t~0#1.offset;main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {3322#true} is VALID [2022-02-20 23:48:29,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {3322#true} assume !(~bvslt32(main_~i~0#1, 10bv32) && 0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {3322#true} is VALID [2022-02-20 23:48:29,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {3322#true} assume !!(~bvslt32(main_~y~0#1, 10bv32) && 0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1;main_#t~post9#1 := main_~y~0#1;main_~y~0#1 := ~bvadd32(1bv32, main_#t~post9#1);havoc main_#t~post9#1; {3322#true} is VALID [2022-02-20 23:48:29,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {3322#true} SUMMARY for call write~intINTTYPE4(2bv32, main_~p~0#1.base, main_~p~0#1.offset, 4bv32); srcloc: L549 {3322#true} is VALID [2022-02-20 23:48:29,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {3322#true} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(8bv32);main_~t~0#1.base, main_~t~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset; {3348#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:48:29,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {3348#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} assume !(main_~t~0#1.base == 0bv32 && main_~t~0#1.offset == 0bv32); {3348#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:48:29,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {3348#(and (= |ULTIMATE.start_main_~t~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~t~0#1.base|) (_ bv8 32)))} SUMMARY for call write~$Pointer$(main_~t~0#1.base, main_~t~0#1.offset, main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L551-3 {3355#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:48:29,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {3355#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~p~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~p~0#1.base, ~bvadd32(4bv32, main_~p~0#1.offset), 4bv32); srcloc: L552 {3359#(and (= (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~mem11#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:29,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {3359#(and (= (select |#length| |ULTIMATE.start_main_#t~mem11#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~mem11#1.offset| (_ bv0 32)))} main_~p~0#1.base, main_~p~0#1.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {3363#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:29,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {3363#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !(~bvslt32(main_~y~0#1, 10bv32) && 0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {3363#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:29,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {3363#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~p~0#1.offset), #length[main_~p~0#1.base]) && ~bvule32(main_~p~0#1.offset, ~bvadd32(4bv32, main_~p~0#1.offset))) && ~bvule32(0bv32, main_~p~0#1.offset)); {3323#false} is VALID [2022-02-20 23:48:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:29,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:29,665 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:29,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240745334] [2022-02-20 23:48:29,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240745334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:29,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:29,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:29,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386337446] [2022-02-20 23:48:29,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:29,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:29,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:29,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:29,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:29,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:29,681 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,859 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-02-20 23:48:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:30,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-02-20 23:48:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-02-20 23:48:30,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-02-20 23:48:30,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,995 INFO L225 Difference]: With dead ends: 122 [2022-02-20 23:48:30,995 INFO L226 Difference]: Without dead ends: 122 [2022-02-20 23:48:30,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:30,996 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:30,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-20 23:48:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2022-02-20 23:48:30,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:30,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,999 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,999 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,001 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-02-20 23:48:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-02-20 23:48:31,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 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 122 states. [2022-02-20 23:48:31,002 INFO L87 Difference]: Start difference. First operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 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 122 states. [2022-02-20 23:48:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,008 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-02-20 23:48:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-02-20 23:48:31,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:31,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-02-20 23:48:31,012 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 14 [2022-02-20 23:48:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:31,012 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-02-20 23:48:31,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-02-20 23:48:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:48:31,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:31,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:31,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:31,222 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 34 more)] === [2022-02-20 23:48:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -177044285, now seen corresponding path program 1 times [2022-02-20 23:48:31,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:31,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280418467] [2022-02-20 23:48:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:31,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:31,224 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:31,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:48:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:31,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:48:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:31,329 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:48:31,329 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:48:31,330 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (36 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (35 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (34 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (33 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (32 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (31 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (30 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (29 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (28 of 38 remaining) [2022-02-20 23:48:31,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (27 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (26 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (25 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (24 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (23 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (22 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (21 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (20 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (19 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (18 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (17 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (16 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (15 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (14 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (13 of 38 remaining) [2022-02-20 23:48:31,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (12 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (11 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (10 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (9 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (8 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (7 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2022-02-20 23:48:31,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-02-20 23:48:31,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:31,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:31,536 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,538 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:48:31,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:48:31 BoogieIcfgContainer [2022-02-20 23:48:31,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:48:31,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:48:31,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:48:31,562 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:48:31,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:18" (3/4) ... [2022-02-20 23:48:31,565 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:48:31,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:48:31,566 INFO L158 Benchmark]: Toolchain (without parser) took 14141.56ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 28.1MB in the beginning and 58.1MB in the end (delta: -30.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:31,566 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 52.4MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:31,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.32ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.9MB in the beginning and 38.1MB in the end (delta: -10.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-02-20 23:48:31,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.16ms. Allocated memory is still 65.0MB. Free memory was 38.1MB in the beginning and 35.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:31,567 INFO L158 Benchmark]: Boogie Preprocessor took 52.91ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 46.3MB in the end (delta: -10.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-02-20 23:48:31,567 INFO L158 Benchmark]: RCFGBuilder took 766.65ms. Allocated memory is still 65.0MB. Free memory was 46.0MB in the beginning and 39.4MB in the end (delta: 6.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 23:48:31,567 INFO L158 Benchmark]: TraceAbstraction took 12794.80ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 38.9MB in the beginning and 58.1MB in the end (delta: -19.2MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-02-20 23:48:31,567 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 79.7MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:31,569 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 52.4MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.32ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.9MB in the beginning and 38.1MB in the end (delta: -10.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.16ms. Allocated memory is still 65.0MB. Free memory was 38.1MB in the beginning and 35.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.91ms. Allocated memory is still 65.0MB. Free memory was 35.5MB in the beginning and 46.3MB in the end (delta: -10.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * RCFGBuilder took 766.65ms. Allocated memory is still 65.0MB. Free memory was 46.0MB in the beginning and 39.4MB in the end (delta: 6.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12794.80ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 38.9MB in the beginning and 58.1MB in the end (delta: -19.2MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 79.7MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 569]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 569. Possible FailurePath: [L533] int i = 0; [L534] int y = 0; [L535] List a = (List) malloc(sizeof(struct node)); [L536] COND FALSE !(a == 0) VAL [a={6:0}, i=0, y=0] [L537] List t; [L538] List p = a; VAL [a={6:0}, i=0, p={6:0}, y=0] [L539] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L547] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L555] p->h = 3 VAL [a={6:0}, i=0, p={6:0}, y=0] [L556] p->n = (void*)__VERIFIER_nondet_ulong() VAL [__VERIFIER_nondet_ulong()=0, a={6:0}, i=0, p={6:0}, y=0] [L557] i = 0 [L558] y = 0 [L559] p = a VAL [a={6:0}, i=0, p={6:0}, y=0] [L560] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, p->h=3, y=0] [L560] COND FALSE !(p->h == 1) [L564] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, p->h=3, y=0] [L564] COND FALSE !(p->h == 2) [L568] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, p->h=3, y=0] [L568] COND TRUE p->h != 3 || (i + y) < 20 [L569] reach_error() VAL [a={6:0}, i=0, p={6:0}, y=0] - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 771 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 771 mSDsluCounter, 1088 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 692 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 396 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=3, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 286 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 30 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:48:31,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample