./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/SyntaxSupportPointer01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 4ce5b36ec45142454df368b1219eecfd99c0ab690f893f50424ec8a6183a262e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:03:34,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:03:34,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:03:34,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:03:34,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:03:34,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:03:34,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:03:34,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:03:34,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:03:34,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:03:34,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:03:34,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:03:34,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:03:34,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:03:34,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:03:34,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:03:34,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:03:34,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:03:34,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:03:34,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:03:34,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:03:34,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:03:34,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:03:34,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:03:34,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:03:34,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:03:34,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:03:34,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:03:34,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:03:34,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:03:34,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:03:34,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:03:34,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:03:34,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:03:34,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:03:34,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:03:34,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:03:34,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:03:34,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:03:34,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:03:34,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:03:34,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-02-21 00:03:34,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:03:34,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:03:34,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:03:34,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:03:34,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:03:34,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:03:34,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:03:34,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:03:34,337 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:03:34,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:03:34,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:03:34,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:03:34,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:03:34,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:03:34,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:03:34,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:03:34,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:34,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:03:34,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:03:34,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:03:34,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:03:34,340 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ce5b36ec45142454df368b1219eecfd99c0ab690f893f50424ec8a6183a262e [2022-02-21 00:03:34,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:03:34,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:03:34,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:03:34,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:03:34,529 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:03:34,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-1.c [2022-02-21 00:03:34,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75093fd58/23d09b80e46f41219683e57863d36b42/FLAGadb5dab8f [2022-02-21 00:03:34,867 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:03:34,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-1.c [2022-02-21 00:03:34,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75093fd58/23d09b80e46f41219683e57863d36b42/FLAGadb5dab8f [2022-02-21 00:03:35,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75093fd58/23d09b80e46f41219683e57863d36b42 [2022-02-21 00:03:35,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:03:35,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:03:35,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:35,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:03:35,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:03:35,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123e06df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35, skipping insertion in model container [2022-02-21 00:03:35,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:03:35,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:03:35,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:35,451 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:03:35,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:35,478 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:03:35,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35 WrapperNode [2022-02-21 00:03:35,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:35,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:35,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:03:35,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:03:35,487 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:03:35" (1/1) ... [2022-02-21 00:03:35,493 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:03:35" (1/1) ... [2022-02-21 00:03:35,510 INFO L137 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-02-21 00:03:35,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:35,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:03:35,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:03:35,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:03:35,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:03:35,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:03:35,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:03:35,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:03:35,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (1/1) ... [2022-02-21 00:03:35,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:35,552 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:03:35,559 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:03:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:03:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 00:03:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:03:35,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:03:35,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:03:35,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:03:35,620 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:03:35,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:03:35,740 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:03:35,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:03:35,745 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:03:35,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:35 BoogieIcfgContainer [2022-02-21 00:03:35,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:03:35,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:03:35,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:03:35,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:03:35,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:03:35" (1/3) ... [2022-02-21 00:03:35,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd5de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:35, skipping insertion in model container [2022-02-21 00:03:35,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:35" (2/3) ... [2022-02-21 00:03:35,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbd5de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:35, skipping insertion in model container [2022-02-21 00:03:35,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:35" (3/3) ... [2022-02-21 00:03:35,752 INFO L111 eAbstractionObserver]: Analyzing ICFG SyntaxSupportPointer01-1.c [2022-02-21 00:03:35,755 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:03:35,768 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-02-21 00:03:35,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:03:35,813 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:03:35,813 INFO L340 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-02-21 00:03:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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:03:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:35,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:35,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:35,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2022-02-21 00:03:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-21 00:03:35,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:35,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38622652] [2022-02-21 00:03:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:36,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2022-02-21 00:03:36,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#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~nondet2#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem3#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {33#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-21 00:03:36,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {32#false} is VALID [2022-02-21 00:03:36,042 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:03:36,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:36,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38622652] [2022-02-21 00:03:36,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38622652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:36,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:36,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:36,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496238828] [2022-02-21 00:03:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:36,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-21 00:03:36,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:36,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:36,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:36,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:36,086 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,164 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-21 00:03:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-21 00:03:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 00:03:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 00:03:36,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 00:03:36,222 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:03:36,230 INFO L225 Difference]: With dead ends: 23 [2022-02-21 00:03:36,230 INFO L226 Difference]: Without dead ends: 21 [2022-02-21 00:03:36,234 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:03:36,237 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:36,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-21 00:03:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 00:03:36,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:36,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 20 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:03:36,267 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 20 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:03:36,267 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 20 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:03:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,272 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-21 00:03:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-21 00:03:36,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 20 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 21 states. [2022-02-21 00:03:36,274 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 20 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 21 states. [2022-02-21 00:03:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,277 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-21 00:03:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-21 00:03:36,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:36,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.5) internal successors, (21), 20 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:03:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-02-21 00:03:36,285 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 3 [2022-02-21 00:03:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:36,285 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-02-21 00:03:36,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-21 00:03:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:36,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:36,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:36,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:03:36,287 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2022-02-21 00:03:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 00:03:36,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:36,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993915409] [2022-02-21 00:03:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:36,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {122#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {122#true} is VALID [2022-02-21 00:03:36,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#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~nondet2#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem3#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {124#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:03:36,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {123#false} is VALID [2022-02-21 00:03:36,348 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:03:36,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:36,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993915409] [2022-02-21 00:03:36,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993915409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:36,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:36,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:36,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660586581] [2022-02-21 00:03:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:36,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-21 00:03:36,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:36,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:36,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:36,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:36,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:36,359 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,396 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-21 00:03:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-21 00:03:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 00:03:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 00:03:36,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-02-21 00:03:36,420 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:03:36,420 INFO L225 Difference]: With dead ends: 16 [2022-02-21 00:03:36,420 INFO L226 Difference]: Without dead ends: 16 [2022-02-21 00:03:36,421 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:03:36,426 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:36,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-21 00:03:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 00:03:36,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:36,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:03:36,431 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:03:36,433 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:03:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,434 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-21 00:03:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-21 00:03:36,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 states. [2022-02-21 00:03:36,436 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 states. [2022-02-21 00:03:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,437 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-21 00:03:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-21 00:03:36,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:36,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:03:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-21 00:03:36,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2022-02-21 00:03:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:36,440 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-21 00:03:36,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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:03:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-21 00:03:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 00:03:36,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:36,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:36,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:03:36,441 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2022-02-21 00:03:36,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:36,442 INFO L85 PathProgramCache]: Analyzing trace with hash 59325548, now seen corresponding path program 1 times [2022-02-21 00:03:36,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:36,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132901465] [2022-02-21 00:03:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:36,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {191#true} is VALID [2022-02-21 00:03:36,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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~nondet2#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem3#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:36,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(main_#t~nondet2#1, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L15 {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:36,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} havoc main_#t~nondet2#1; {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:36,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call main_#t~mem3#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L16-3 {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:36,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1; {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:36,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume 0 == main_~p~0#1.offset; {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:36,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {193#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(main_~p~0#1.base < #StackHeapBarrier); {192#false} is VALID [2022-02-21 00:03:36,496 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:03:36,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:36,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132901465] [2022-02-21 00:03:36,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132901465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:36,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:36,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:36,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428056200] [2022-02-21 00:03:36,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:36,498 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 8 [2022-02-21 00:03:36,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:36,498 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:03:36,504 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:03:36,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:36,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:36,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:36,505 INFO L87 Difference]: Start difference. First operand 16 states and 16 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:03:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,523 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 00:03:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:36,523 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 8 [2022-02-21 00:03:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:36,524 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:03:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 00:03:36,525 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:03:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-21 00:03:36,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-21 00:03:36,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,541 INFO L225 Difference]: With dead ends: 15 [2022-02-21 00:03:36,541 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 00:03:36,541 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:03:36,542 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:36,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 00:03:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 00:03:36,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:36,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:03:36,545 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:03:36,545 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:03:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,546 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 00:03:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-21 00:03:36,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 states. [2022-02-21 00:03:36,547 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 states. [2022-02-21 00:03:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,548 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 00:03:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-21 00:03:36,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:36,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:03:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-02-21 00:03:36,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-02-21 00:03:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:36,550 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-02-21 00:03:36,550 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:03:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-21 00:03:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 00:03:36,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:36,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:36,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:03:36,552 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 8 more)] === [2022-02-21 00:03:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1177278863, now seen corresponding path program 1 times [2022-02-21 00:03:36,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:36,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431208742] [2022-02-21 00:03:36,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:36,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {256#true} is VALID [2022-02-21 00:03:36,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#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~nondet2#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem3#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call write~int(main_#t~nondet2#1, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L15 {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} havoc main_#t~nondet2#1; {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call main_#t~mem3#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L16-3 {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1; {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~p~0#1.offset; {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume main_~p~0#1.base < #StackHeapBarrier; {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:36,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~p~0#1.base || 1 == #valid[main_~p~0#1.base];call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_#res#1 := 0; {259#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:36,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {257#false} is VALID [2022-02-21 00:03:36,604 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:03:36,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:36,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431208742] [2022-02-21 00:03:36,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431208742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:36,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:36,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:36,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239173210] [2022-02-21 00:03:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:36,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 00:03:36,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:36,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:03:36,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:03:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:03:36,617 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,656 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 00:03:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 00:03:36,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 00:03:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 00:03:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 00:03:36,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-02-21 00:03:36,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:36,670 INFO L225 Difference]: With dead ends: 14 [2022-02-21 00:03:36,670 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 00:03:36,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:03:36,672 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:36,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 00:03:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 00:03:36,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:36,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,673 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,674 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:36,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 00:03:36,675 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 00:03:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:36,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:36,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:36,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:36,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 00:03:36,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2022-02-21 00:03:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:36,677 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 00:03:36,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:36,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:36,686 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (11 of 12 remaining) [2022-02-21 00:03:36,687 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (10 of 12 remaining) [2022-02-21 00:03:36,687 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (9 of 12 remaining) [2022-02-21 00:03:36,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (8 of 12 remaining) [2022-02-21 00:03:36,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (7 of 12 remaining) [2022-02-21 00:03:36,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (6 of 12 remaining) [2022-02-21 00:03:36,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (5 of 12 remaining) [2022-02-21 00:03:36,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (4 of 12 remaining) [2022-02-21 00:03:36,688 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 12 remaining) [2022-02-21 00:03:36,689 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 12 remaining) [2022-02-21 00:03:36,689 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 12 remaining) [2022-02-21 00:03:36,689 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (0 of 12 remaining) [2022-02-21 00:03:36,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:03:36,692 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 00:03:36,694 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:36,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:36 BoogieIcfgContainer [2022-02-21 00:03:36,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:36,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:36,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:36,697 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:36,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:35" (3/4) ... [2022-02-21 00:03:36,700 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 00:03:36,708 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-21 00:03:36,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-21 00:03:36,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-21 00:03:36,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 00:03:36,734 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:36,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:36,735 INFO L158 Benchmark]: Toolchain (without parser) took 1429.95ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 50.4MB in the beginning and 96.0MB in the end (delta: -45.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:36,735 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:36,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.84ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 50.2MB in the beginning and 99.5MB in the end (delta: -49.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-02-21 00:03:36,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.20ms. Allocated memory is still 123.7MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:36,736 INFO L158 Benchmark]: Boogie Preprocessor took 13.04ms. Allocated memory is still 123.7MB. Free memory was 98.0MB in the beginning and 96.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:36,736 INFO L158 Benchmark]: RCFGBuilder took 221.23ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 85.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 00:03:36,737 INFO L158 Benchmark]: TraceAbstraction took 948.71ms. Allocated memory is still 123.7MB. Free memory was 84.5MB in the beginning and 98.9MB in the end (delta: -14.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:36,737 INFO L158 Benchmark]: Witness Printer took 36.94ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 96.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:36,738 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.36ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 46.9MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.84ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 50.2MB in the beginning and 99.5MB in the end (delta: -49.3MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.20ms. Allocated memory is still 123.7MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.04ms. Allocated memory is still 123.7MB. Free memory was 98.0MB in the beginning and 96.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.23ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 85.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 948.71ms. Allocated memory is still 123.7MB. Free memory was 84.5MB in the beginning and 98.9MB in the end (delta: -14.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 36.94ms. Allocated memory is still 123.7MB. Free memory was 98.9MB in the beginning and 96.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 19]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 19]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 13]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 37 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 00:03:36,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE