./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c -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 cb3174b12ccafcfa2421015218ce7e009c2319e912e783d4246aed1266b2586b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:44,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:44,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:44,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:44,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:44,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:44,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:44,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:44,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:44,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:44,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:44,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:44,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:44,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:44,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:44,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:44,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:44,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:44,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:44,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:44,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:44,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:44,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:44,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:44,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:45,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:45,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:45,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:45,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:45,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:45,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:45,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:45,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:45,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:45,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:45,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:45,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:45,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:45,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:45,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:45,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:45,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:45,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:45,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:45,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:45,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:45,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:45,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:45,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:45,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:45,031 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:45,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:45,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:45,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:45,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:45,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:45,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:45,032 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:45,032 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:45,033 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:45,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:45,033 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:45,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:45,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:45,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:45,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:45,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:45,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:45,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:45,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:45,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:45,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:45,035 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 -> cb3174b12ccafcfa2421015218ce7e009c2319e912e783d4246aed1266b2586b [2022-02-21 00:02:45,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:45,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:45,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:45,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:45,256 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:45,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2022-02-21 00:02:45,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765bae9eb/a30f145ab45d4c6d972b16ae14af4d00/FLAG162f3b81f [2022-02-21 00:02:45,648 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:45,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2022-02-21 00:02:45,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765bae9eb/a30f145ab45d4c6d972b16ae14af4d00/FLAG162f3b81f [2022-02-21 00:02:46,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765bae9eb/a30f145ab45d4c6d972b16ae14af4d00 [2022-02-21 00:02:46,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:46,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:46,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:46,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:46,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:46,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46, skipping insertion in model container [2022-02-21 00:02:46,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:46,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:46,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:46,282 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:46,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:46,315 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:46,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46 WrapperNode [2022-02-21 00:02:46,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:46,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:46,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:46,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:46,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,357 INFO L137 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-02-21 00:02:46,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:46,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:46,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:46,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:46,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:46,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:46,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:46,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:46,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (1/1) ... [2022-02-21 00:02:46,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:46,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:46,445 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-21 00:02:46,460 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-21 00:02:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:02:46,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:46,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:02:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 00:02:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:02:46,537 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:46,539 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:46,714 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:46,725 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:46,726 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:46,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:46 BoogieIcfgContainer [2022-02-21 00:02:46,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:46,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:46,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:46,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:46,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:46" (1/3) ... [2022-02-21 00:02:46,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22296452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:46, skipping insertion in model container [2022-02-21 00:02:46,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:46" (2/3) ... [2022-02-21 00:02:46,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22296452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:46, skipping insertion in model container [2022-02-21 00:02:46,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:46" (3/3) ... [2022-02-21 00:02:46,739 INFO L111 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2022-02-21 00:02:46,743 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:46,744 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 00:02:46,795 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:46,805 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-21 00:02:46,805 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 00:02:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:46,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:46,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:46,828 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 926022, now seen corresponding path program 1 times [2022-02-21 00:02:46,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:46,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890469901] [2022-02-21 00:02:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:46,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#true} is VALID [2022-02-21 00:02:46,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {26#true} is VALID [2022-02-21 00:02:47,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-02-21 00:02:47,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume !(1 == #valid[main_~p~0#1.base]); {27#false} is VALID [2022-02-21 00:02:47,010 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-21 00:02:47,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890469901] [2022-02-21 00:02:47,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890469901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:47,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850769659] [2022-02-21 00:02:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:47,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:47,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:47,073 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,121 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-21 00:02:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-02-21 00:02:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-02-21 00:02:47,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 25 transitions. [2022-02-21 00:02:47,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,187 INFO L225 Difference]: With dead ends: 23 [2022-02-21 00:02:47,188 INFO L226 Difference]: Without dead ends: 21 [2022-02-21 00:02:47,190 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-21 00:02:47,195 INFO L933 BasicCegarLoop]: 24 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, 24 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-21 00:02:47,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-21 00:02:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 00:02:47,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:47,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,225 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,227 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,233 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-21 00:02:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-21 00:02:47,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-21 00:02:47,235 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-21 00:02:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,239 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-21 00:02:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-21 00:02:47,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:47,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-21 00:02:47,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 4 [2022-02-21 00:02:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:47,249 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-21 00:02:47,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-21 00:02:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:47,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:47,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:47,252 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-02-21 00:02:47,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134225522] [2022-02-21 00:02:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {116#true} is VALID [2022-02-21 00:02:47,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {118#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:47,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 10); {117#false} is VALID [2022-02-21 00:02:47,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {117#false} assume !(1 == #valid[main_~p~0#1.base]); {117#false} is VALID [2022-02-21 00:02:47,317 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-21 00:02:47,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134225522] [2022-02-21 00:02:47,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134225522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:47,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404440045] [2022-02-21 00:02:47,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:47,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,340 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,392 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 00:02:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 00:02:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 00:02:47,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 00:02:47,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,433 INFO L225 Difference]: With dead ends: 27 [2022-02-21 00:02:47,434 INFO L226 Difference]: Without dead ends: 27 [2022-02-21 00:02:47,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,441 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:47,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-21 00:02:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-02-21 00:02:47,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:47,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,450 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,451 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,454 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 00:02:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-21 00:02:47,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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 27 states. [2022-02-21 00:02:47,455 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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 27 states. [2022-02-21 00:02:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,461 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 00:02:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-21 00:02:47,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:47,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-21 00:02:47,464 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2022-02-21 00:02:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:47,465 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-21 00:02:47,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-21 00:02:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:47,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:47,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:47,467 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 00:02:47,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25291764] [2022-02-21 00:02:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {224#true} is VALID [2022-02-21 00:02:47,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {226#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-21 00:02:47,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {226#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-21 00:02:47,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {226#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {225#false} is VALID [2022-02-21 00:02:47,550 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-21 00:02:47,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25291764] [2022-02-21 00:02:47,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25291764] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:47,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823503583] [2022-02-21 00:02:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:47,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,560 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,607 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 00:02:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 00:02:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 00:02:47,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 00:02:47,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,633 INFO L225 Difference]: With dead ends: 20 [2022-02-21 00:02:47,633 INFO L226 Difference]: Without dead ends: 20 [2022-02-21 00:02:47,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,640 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:47,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-21 00:02:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 00:02:47,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:47,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,647 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,648 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,650 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 00:02:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 00:02:47,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 00:02:47,652 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 00:02:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,657 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 00:02:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 00:02:47,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:47,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-21 00:02:47,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2022-02-21 00:02:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:47,659 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-21 00:02:47,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-21 00:02:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:47,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:47,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:47,660 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-21 00:02:47,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114097331] [2022-02-21 00:02:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {308#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {308#true} is VALID [2022-02-21 00:02:47,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {310#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:47,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {310#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:47,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {309#false} is VALID [2022-02-21 00:02:47,709 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-21 00:02:47,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114097331] [2022-02-21 00:02:47,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114097331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:47,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:47,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:47,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616955641] [2022-02-21 00:02:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:47,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:47,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,722 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,764 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-21 00:02:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:47,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 00:02:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 00:02:47,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-21 00:02:47,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,789 INFO L225 Difference]: With dead ends: 22 [2022-02-21 00:02:47,789 INFO L226 Difference]: Without dead ends: 22 [2022-02-21 00:02:47,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:47,790 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:47,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-21 00:02:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-02-21 00:02:47,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:47,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,795 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,795 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,797 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-21 00:02:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-21 00:02:47,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-21 00:02:47,798 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-21 00:02:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:47,799 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-21 00:02:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-21 00:02:47,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:47,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:47,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:47,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-21 00:02:47,802 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 4 [2022-02-21 00:02:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:47,802 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-21 00:02:47,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-21 00:02:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 00:02:47,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:47,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:47,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:47,803 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 264435860, now seen corresponding path program 1 times [2022-02-21 00:02:47,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:47,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701096723] [2022-02-21 00:02:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {399#true} is VALID [2022-02-21 00:02:47,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {401#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:47,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {401#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:47,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {401#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {401#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:47,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {401#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet3#1; {401#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:47,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {402#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:47,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 10); {400#false} is VALID [2022-02-21 00:02:47,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#false} assume !(1 + (2 + main_~p~0#1.offset) <= #length[main_~p~0#1.base] && 0 <= 2 + main_~p~0#1.offset); {400#false} is VALID [2022-02-21 00:02:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:47,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:47,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701096723] [2022-02-21 00:02:47,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701096723] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:47,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208168005] [2022-02-21 00:02:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:47,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:47,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 00:02:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 00:02:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:47,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:48,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {399#true} is VALID [2022-02-21 00:02:48,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:48,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:48,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:48,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet3#1; {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:48,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {409#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {402#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:48,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 10); {400#false} is VALID [2022-02-21 00:02:48,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#false} assume !(1 + (2 + main_~p~0#1.offset) <= #length[main_~p~0#1.base] && 0 <= 2 + main_~p~0#1.offset); {400#false} is VALID [2022-02-21 00:02:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:48,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {400#false} assume !(1 + (2 + main_~p~0#1.offset) <= #length[main_~p~0#1.base] && 0 <= 2 + main_~p~0#1.offset); {400#false} is VALID [2022-02-21 00:02:48,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {400#false} is VALID [2022-02-21 00:02:48,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {431#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 00:02:48,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~nondet3#1; {435#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:48,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#(< |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {435#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:48,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {435#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:48,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {435#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:48,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {399#true} is VALID [2022-02-21 00:02:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208168005] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:48,088 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:48,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 00:02:48,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084439951] [2022-02-21 00:02:48,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:48,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-21 00:02:48,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:48,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 00:02:48,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:48,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 00:02:48,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:02:48,106 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,170 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-21 00:02:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:02:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-21 00:02:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-21 00:02:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-21 00:02:48,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-21 00:02:48,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:48,204 INFO L225 Difference]: With dead ends: 33 [2022-02-21 00:02:48,204 INFO L226 Difference]: Without dead ends: 33 [2022-02-21 00:02:48,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:02:48,205 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:48,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-21 00:02:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-02-21 00:02:48,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:48,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,209 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,209 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,211 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-21 00:02:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-21 00:02:48,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-21 00:02:48,212 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-21 00:02:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:48,213 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-21 00:02:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-21 00:02:48,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:48,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:48,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:48,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-21 00:02:48,216 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 8 [2022-02-21 00:02:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:48,216 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-21 00:02:48,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-21 00:02:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 00:02:48,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:48,217 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:48,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 00:02:48,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:48,430 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 264435913, now seen corresponding path program 1 times [2022-02-21 00:02:48,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:48,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912986806] [2022-02-21 00:02:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {580#true} is VALID [2022-02-21 00:02:48,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {583#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {583#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {581#false} is VALID [2022-02-21 00:02:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:48,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912986806] [2022-02-21 00:02:48,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912986806] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:48,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778617780] [2022-02-21 00:02:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:48,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:48,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 00:02:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 00:02:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:48,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:48,688 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-21 00:02:48,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {580#true} is VALID [2022-02-21 00:02:48,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {602#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {602#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {602#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:48,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {602#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {581#false} is VALID [2022-02-21 00:02:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:48,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {581#false} is VALID [2022-02-21 00:02:48,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {609#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:48,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {609#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:48,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} havoc main_#t~nondet3#1; {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:48,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:48,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:48,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {616#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:48,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {580#true} is VALID [2022-02-21 00:02:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:48,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778617780] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:48,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:48,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-02-21 00:02:48,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324762540] [2022-02-21 00:02:48,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) 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 8 [2022-02-21 00:02:48,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:48,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) 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-21 00:02:48,942 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-21 00:02:48,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 00:02:48,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 00:02:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:02:48,944 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 3.0) 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-21 00:02:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,090 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-21 00:02:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:02:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) 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 8 [2022-02-21 00:02:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) 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-21 00:02:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-21 00:02:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) 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-21 00:02:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-21 00:02:49,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-21 00:02:49,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:49,128 INFO L225 Difference]: With dead ends: 32 [2022-02-21 00:02:49,128 INFO L226 Difference]: Without dead ends: 32 [2022-02-21 00:02:49,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:02:49,129 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:49,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:02:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-21 00:02:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-21 00:02:49,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:49,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,132 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,132 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,133 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-21 00:02:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-21 00:02:49,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-21 00:02:49,134 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-21 00:02:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,135 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-21 00:02:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-21 00:02:49,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:49,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-02-21 00:02:49,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 8 [2022-02-21 00:02:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,137 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-02-21 00:02:49,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) 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-21 00:02:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-21 00:02:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:49,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,138 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1] [2022-02-21 00:02:49,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:49,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 00:02:49,352 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2061457123, now seen corresponding path program 2 times [2022-02-21 00:02:49,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525457330] [2022-02-21 00:02:49,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {761#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {761#true} is VALID [2022-02-21 00:02:49,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(main_~i~0#1 < 10); {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {763#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(1 + (2 + main_~p~0#1.offset) <= #length[main_~p~0#1.base] && 0 <= 2 + main_~p~0#1.offset); {762#false} is VALID [2022-02-21 00:02:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-21 00:02:49,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525457330] [2022-02-21 00:02:49,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525457330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:49,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:49,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:49,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117607847] [2022-02-21 00:02:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 20 [2022-02-21 00:02:49,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:49,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-21 00:02:49,437 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-21 00:02:49,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:49,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:49,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:49,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:49,438 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-21 00:02:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,456 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-21 00:02:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:49,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 20 [2022-02-21 00:02:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-21 00:02:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 00:02:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-21 00:02:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 00:02:49,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2022-02-21 00:02:49,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:49,480 INFO L225 Difference]: With dead ends: 30 [2022-02-21 00:02:49,481 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 00:02:49,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:49,482 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:49,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 00:02:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-21 00:02:49,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:49,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,486 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,486 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,487 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-21 00:02:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-21 00:02:49,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 30 states. [2022-02-21 00:02:49,489 INFO L87 Difference]: Start difference. First operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 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 30 states. [2022-02-21 00:02:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:49,490 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-21 00:02:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-21 00:02:49,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:49,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:49,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:49,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-02-21 00:02:49,492 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2022-02-21 00:02:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:49,492 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-02-21 00:02:49,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-21 00:02:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-21 00:02:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:49,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:49,493 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2022-02-21 00:02:49,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:49,493 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2061457070, now seen corresponding path program 2 times [2022-02-21 00:02:49,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:49,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877975746] [2022-02-21 00:02:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {886#true} is VALID [2022-02-21 00:02:49,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {889#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (+ 9 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 8) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:49,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {891#(and (<= (+ 7 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {892#(and (<= (+ 6 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:49,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {892#(and (<= (+ 6 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {892#(and (<= (+ 6 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:49,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {892#(and (<= (+ 6 |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {887#false} is VALID [2022-02-21 00:02:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:49,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:49,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877975746] [2022-02-21 00:02:49,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877975746] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:49,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913434115] [2022-02-21 00:02:49,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:02:49,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:49,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:49,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:49,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 00:02:49,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:02:49,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:02:49,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 00:02:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:49,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:49,783 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-21 00:02:50,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {886#true} is VALID [2022-02-21 00:02:50,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {888#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {911#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {924#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {937#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {950#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {950#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {950#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:50,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {950#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {887#false} is VALID [2022-02-21 00:02:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:50,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:50,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {957#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {887#false} is VALID [2022-02-21 00:02:50,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {957#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {957#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:50,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {957#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:50,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} havoc main_#t~nondet3#1; {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {964#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 1)) (<= (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} havoc main_#t~nondet3#1; {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {977#(and (<= 0 (+ 2 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} havoc main_#t~nondet3#1; {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {990#(and (<= 0 (+ 3 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} havoc main_#t~nondet3#1; {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {1003#(and (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset| 4)) (<= (+ 5 |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-21 00:02:50,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {886#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {886#true} is VALID [2022-02-21 00:02:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:50,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913434115] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:50,343 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:50,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-02-21 00:02:50,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164177025] [2022-02-21 00:02:50,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:50,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:50,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:50,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 00:02:50,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 00:02:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-02-21 00:02:50,403 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,011 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-02-21 00:02:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:02:51,011 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-02-21 00:02:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-02-21 00:02:51,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2022-02-21 00:02:51,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,115 INFO L225 Difference]: With dead ends: 99 [2022-02-21 00:02:51,115 INFO L226 Difference]: Without dead ends: 99 [2022-02-21 00:02:51,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2022-02-21 00:02:51,116 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 172 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:51,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 106 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:02:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-21 00:02:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2022-02-21 00:02:51,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:51,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,120 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,121 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,123 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-02-21 00:02:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-02-21 00:02:51,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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-21 00:02:51,124 INFO L87 Difference]: Start difference. First operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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-21 00:02:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:51,127 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-02-21 00:02:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-02-21 00:02:51,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:51,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:51,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:51,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-02-21 00:02:51,130 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 20 [2022-02-21 00:02:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:51,130 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-02-21 00:02:51,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-21 00:02:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-21 00:02:51,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:51,131 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:51,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-21 00:02:51,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:51,355 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1807984667, now seen corresponding path program 1 times [2022-02-21 00:02:51,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:51,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390962009] [2022-02-21 00:02:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {1377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1377#true} is VALID [2022-02-21 00:02:51,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet3#1; {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet3#1; {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet3#1; {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet3#1; {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet3#1; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:51,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < 10); {1378#false} is VALID [2022-02-21 00:02:51,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1378#false} SUMMARY for call main_#t~mem4#1 := read~int(main_~p~0#1.base, 2 + main_~p~0#1.offset, 1); srcloc: L9-4 {1378#false} is VALID [2022-02-21 00:02:51,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {1378#false} assume !(97 == main_#t~mem4#1);havoc main_#t~mem4#1; {1378#false} is VALID [2022-02-21 00:02:51,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {1378#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1378#false} is VALID [2022-02-21 00:02:51,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {1378#false} assume !(#valid == main_old_#valid#1); {1378#false} is VALID [2022-02-21 00:02:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:51,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:51,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390962009] [2022-02-21 00:02:51,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390962009] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:51,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456517997] [2022-02-21 00:02:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:51,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:51,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:51,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:51,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 00:02:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 00:02:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:51,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:51,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1377#true} is VALID [2022-02-21 00:02:51,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~nondet3#1; {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:51,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {1391#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~nondet3#1; {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:51,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {1380#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~nondet3#1; {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:51,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} havoc main_#t~nondet3#1; {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:51,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet3#1; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:51,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < 10); {1378#false} is VALID [2022-02-21 00:02:51,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {1378#false} SUMMARY for call main_#t~mem4#1 := read~int(main_~p~0#1.base, 2 + main_~p~0#1.offset, 1); srcloc: L9-4 {1378#false} is VALID [2022-02-21 00:02:51,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {1378#false} assume !(97 == main_#t~mem4#1);havoc main_#t~mem4#1; {1378#false} is VALID [2022-02-21 00:02:51,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {1378#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1378#false} is VALID [2022-02-21 00:02:51,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {1378#false} assume !(#valid == main_old_#valid#1); {1378#false} is VALID [2022-02-21 00:02:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:51,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:51,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {1378#false} assume !(#valid == main_old_#valid#1); {1378#false} is VALID [2022-02-21 00:02:51,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {1378#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1378#false} is VALID [2022-02-21 00:02:51,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {1378#false} assume !(97 == main_#t~mem4#1);havoc main_#t~mem4#1; {1378#false} is VALID [2022-02-21 00:02:51,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {1378#false} SUMMARY for call main_#t~mem4#1 := read~int(main_~p~0#1.base, 2 + main_~p~0#1.offset, 1); srcloc: L9-4 {1378#false} is VALID [2022-02-21 00:02:51,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {1479#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {1378#false} is VALID [2022-02-21 00:02:51,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1479#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 00:02:51,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~nondet3#1; {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:51,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:51,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:51,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1483#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:51,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} havoc main_#t~nondet3#1; {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:51,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:51,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:51,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1496#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:51,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} havoc main_#t~nondet3#1; {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:51,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:51,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:51,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1509#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:51,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} havoc main_#t~nondet3#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:51,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:51,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:51,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1384#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:51,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} havoc main_#t~nondet3#1; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {1383#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:51,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1377#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1377#true} is VALID [2022-02-21 00:02:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:51,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456517997] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:51,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:51,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-21 00:02:51,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034390247] [2022-02-21 00:02:51,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:51,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:51,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:51,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:51,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:02:51,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:02:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:51,919 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,009 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-02-21 00:02:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:02:52,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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 27 [2022-02-21 00:02:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-02-21 00:02:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-02-21 00:02:52,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-02-21 00:02:52,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:52,059 INFO L225 Difference]: With dead ends: 54 [2022-02-21 00:02:52,059 INFO L226 Difference]: Without dead ends: 54 [2022-02-21 00:02:52,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:52,060 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:52,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-21 00:02:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-21 00:02:52,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:52,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,064 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,064 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,065 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-02-21 00:02:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-21 00:02:52,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-21 00:02:52,066 INFO L87 Difference]: Start difference. First operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-21 00:02:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:52,068 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-02-21 00:02:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-21 00:02:52,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:52,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:52,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:52,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-02-21 00:02:52,070 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 27 [2022-02-21 00:02:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:52,071 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-02-21 00:02:52,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-21 00:02:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 00:02:52,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:52,072 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1] [2022-02-21 00:02:52,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:52,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:52,287 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash -256132636, now seen corresponding path program 3 times [2022-02-21 00:02:52,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:52,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076284498] [2022-02-21 00:02:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:52,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {1764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1764#true} is VALID [2022-02-21 00:02:52,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {1764#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {1766#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {1767#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {1768#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {1769#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} havoc main_#t~nondet3#1; {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {1771#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 5 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} havoc main_#t~nondet3#1; {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {1773#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} havoc main_#t~nondet3#1; {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:52,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {1774#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 9 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1776#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 10 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:52,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {1776#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 10)) 0) (<= 10 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1765#false} is VALID [2022-02-21 00:02:52,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {1765#false} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {1765#false} is VALID [2022-02-21 00:02:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 163 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:52,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:52,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076284498] [2022-02-21 00:02:52,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076284498] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:52,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833491897] [2022-02-21 00:02:52,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 00:02:52,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:52,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:52,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 00:02:52,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 00:02:52,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:02:52,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 00:02:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:52,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:52,774 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-21 00:02:53,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {1764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1764#true} is VALID [2022-02-21 00:02:53,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1764#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} havoc main_#t~nondet3#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:53,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {1783#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {1898#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:53,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} havoc main_#t~nondet3#1; {1898#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:53,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {1898#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1905#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-21 00:02:53,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {1905#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {1909#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 00:02:53,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {1909#(and (<= 10 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~p~0#1.offset|)) (< |ULTIMATE.start_main_~i~0#1| 10))} assume !(1 + (main_~p~0#1.offset + main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + main_~i~0#1); {1765#false} is VALID [2022-02-21 00:02:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-02-21 00:02:53,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:02:53,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833491897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:53,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:02:53,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-02-21 00:02:53,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804236947] [2022-02-21 00:02:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 44 [2022-02-21 00:02:53,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:53,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:53,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:02:53,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:53,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:02:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2022-02-21 00:02:53,212 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,268 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-21 00:02:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:02:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 44 [2022-02-21 00:02:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 00:02:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 00:02:53,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-02-21 00:02:53,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:53,292 INFO L225 Difference]: With dead ends: 53 [2022-02-21 00:02:53,292 INFO L226 Difference]: Without dead ends: 53 [2022-02-21 00:02:53,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2022-02-21 00:02:53,293 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:53,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-21 00:02:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-02-21 00:02:53,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:53,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,296 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,296 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,297 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-21 00:02:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-21 00:02:53,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 states. [2022-02-21 00:02:53,298 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 states. [2022-02-21 00:02:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,299 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-02-21 00:02:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-02-21 00:02:53,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-02-21 00:02:53,300 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 44 [2022-02-21 00:02:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:53,301 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-02-21 00:02:53,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-02-21 00:02:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 00:02:53,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:53,302 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:53,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:53,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 00:02:53,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:53,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1707920246, now seen corresponding path program 2 times [2022-02-21 00:02:53,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:53,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418901050] [2022-02-21 00:02:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:53,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {2123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2123#true} is VALID [2022-02-21 00:02:53,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {2123#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet3#1, main_#t~post2#1, main_~i~0#1, main_#t~mem4#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(10);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;main_~i~0#1 := 0; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !!(main_~i~0#1 < 10);assume -128 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 127; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet3#1, main_~p~0#1.base, main_~p~0#1.offset + main_~i~0#1, 1); srcloc: L10 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet3#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_~i~0#1 < 10); {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call main_#t~mem4#1 := read~int(main_~p~0#1.base, 2 + main_~p~0#1.offset, 1); srcloc: L9-4 {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(97 == main_#t~mem4#1);havoc main_#t~mem4#1; {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:02:53,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {2125#(= (store |#valid| |ULTIMATE.start_main_#t~malloc1#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} main_#res#1 := 0;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2126#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:53,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {2126#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {2124#false} is VALID [2022-02-21 00:02:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 00:02:53,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:53,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418901050] [2022-02-21 00:02:53,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418901050] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:53,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:53,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:53,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683167539] [2022-02-21 00:02:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 47 [2022-02-21 00:02:53,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:53,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:53,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:02:53,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:53,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:02:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:02:53,706 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,733 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-02-21 00:02:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 00:02:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 47 [2022-02-21 00:02:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 00:02:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 00:02:53,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-02-21 00:02:53,746 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-21 00:02:53,747 INFO L225 Difference]: With dead ends: 54 [2022-02-21 00:02:53,747 INFO L226 Difference]: Without dead ends: 52 [2022-02-21 00:02:53,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:02:53,748 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:53,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-21 00:02:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-21 00:02:53,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:53,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,751 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,751 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,752 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-21 00:02:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-21 00:02:53,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 states. [2022-02-21 00:02:53,753 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 states. [2022-02-21 00:02:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,753 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-21 00:02:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-21 00:02:53,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-02-21 00:02:53,755 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 47 [2022-02-21 00:02:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:53,755 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-02-21 00:02:53,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-21 00:02:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-21 00:02:53,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:53,756 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:53,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:53,756 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 4 more)] === [2022-02-21 00:02:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1707912301, now seen corresponding path program 1 times [2022-02-21 00:02:53,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:53,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282499170] [2022-02-21 00:02:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:53,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:02:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:53,833 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:02:53,833 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:02:53,834 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (7 of 8 remaining) [2022-02-21 00:02:53,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (6 of 8 remaining) [2022-02-21 00:02:53,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (5 of 8 remaining) [2022-02-21 00:02:53,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (4 of 8 remaining) [2022-02-21 00:02:53,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (3 of 8 remaining) [2022-02-21 00:02:53,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 8 remaining) [2022-02-21 00:02:53,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 8 remaining) [2022-02-21 00:02:53,838 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-02-21 00:02:53,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:53,841 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 00:02:53,843 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:53,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:53 BoogieIcfgContainer [2022-02-21 00:02:53,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:53,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:53,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:53,875 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:53,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:46" (3/4) ... [2022-02-21 00:02:53,877 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:02:53,922 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:02:53,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:53,923 INFO L158 Benchmark]: Toolchain (without parser) took 7837.73ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 63.8MB in the beginning and 74.5MB in the end (delta: -10.8MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-02-21 00:02:53,924 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:53,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.73ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 71.0MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 00:02:53,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.99ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:53,924 INFO L158 Benchmark]: Boogie Preprocessor took 45.11ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 68.3MB in the end (delta: 985.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:53,925 INFO L158 Benchmark]: RCFGBuilder took 326.70ms. Allocated memory is still 94.4MB. Free memory was 68.3MB in the beginning and 57.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:53,925 INFO L158 Benchmark]: TraceAbstraction took 7141.88ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 57.0MB in the beginning and 80.8MB in the end (delta: -23.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-02-21 00:02:53,925 INFO L158 Benchmark]: Witness Printer took 47.29ms. Allocated memory is still 144.7MB. Free memory was 80.8MB in the beginning and 75.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 00:02:53,927 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 94.4MB. Free memory was 50.9MB in the beginning and 50.9MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.73ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 71.0MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.99ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.11ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 68.3MB in the end (delta: 985.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.70ms. Allocated memory is still 94.4MB. Free memory was 68.3MB in the beginning and 57.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7141.88ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 57.0MB in the beginning and 80.8MB in the end (delta: -23.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 47.29ms. Allocated memory is still 144.7MB. Free memory was 80.8MB in the beginning and 75.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-1, alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-5, alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-6, alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-9, alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-10, alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L9] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L13] EXPR p[2] VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}, p[2]=97] [L13] COND TRUE p[2] == 'a' [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] - UnprovableResult [Line: 10]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 10]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 6]: 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 1 procedures, 23 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 156 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 344 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 2734 SizeOfPredicates, 6 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 581/858 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 proved your program to be incorrect! [2022-02-21 00:02:53,965 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)