./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb3174b12ccafcfa2421015218ce7e009c2319e912e783d4246aed1266b2586b --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:33:48,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:33:48,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:33:48,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:33:48,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:33:48,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:33:48,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:33:48,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:33:48,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:33:48,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:33:48,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:33:48,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:33:48,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:33:48,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:33:48,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:33:48,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:33:48,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:33:48,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:33:48,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:33:48,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:33:48,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:33:48,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:33:48,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:33:48,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:33:48,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:33:48,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:33:48,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:33:48,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:33:48,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:33:48,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:33:48,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:33:48,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:33:48,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:33:48,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:33:48,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:33:48,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:33:48,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:33:48,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:33:48,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:33:48,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:33:48,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:33:48,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 03:33:48,781 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:33:48,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:33:48,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:33:48,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:33:48,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:33:48,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:33:48,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:33:48,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:33:48,783 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:33:48,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:33:48,784 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:33:48,784 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:33:48,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:33:48,785 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:33:48,786 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:33:48,786 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:33:48,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:33:48,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:33:48,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:33:48,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:33:48,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:33:48,787 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:33:48,788 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb3174b12ccafcfa2421015218ce7e009c2319e912e783d4246aed1266b2586b [2023-02-17 03:33:49,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:33:49,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:33:49,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:33:49,043 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:33:49,044 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:33:49,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2023-02-17 03:33:50,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:33:50,172 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:33:50,173 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2023-02-17 03:33:50,176 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b412be6db/30b86458026a4b3e85e8117d974332b9/FLAGe34e5a98a [2023-02-17 03:33:50,186 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b412be6db/30b86458026a4b3e85e8117d974332b9 [2023-02-17 03:33:50,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:33:50,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:33:50,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:33:50,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:33:50,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:33:50,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cd8034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50, skipping insertion in model container [2023-02-17 03:33:50,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:33:50,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:33:50,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:33:50,297 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:33:50,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:33:50,312 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:33:50,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50 WrapperNode [2023-02-17 03:33:50,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:33:50,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:33:50,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:33:50,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:33:50,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,335 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-17 03:33:50,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:33:50,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:33:50,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:33:50,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:33:50,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:33:50,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:33:50,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:33:50,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:33:50,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (1/1) ... [2023-02-17 03:33:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:33:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:50,412 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) [2023-02-17 03:33:50,415 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 [2023-02-17 03:33:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 03:33:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:33:50,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:33:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 03:33:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 03:33:50,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 03:33:50,487 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:33:50,488 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:33:50,569 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:33:50,573 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:33:50,574 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 03:33:50,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:33:50 BoogieIcfgContainer [2023-02-17 03:33:50,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:33:50,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:33:50,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:33:50,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:33:50,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:33:50" (1/3) ... [2023-02-17 03:33:50,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3437f357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:33:50, skipping insertion in model container [2023-02-17 03:33:50,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:33:50" (2/3) ... [2023-02-17 03:33:50,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3437f357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:33:50, skipping insertion in model container [2023-02-17 03:33:50,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:33:50" (3/3) ... [2023-02-17 03:33:50,581 INFO L112 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2023-02-17 03:33:50,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:33:50,608 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-02-17 03:33:50,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:33:50,641 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b4e1462, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:33:50,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-02-17 03:33:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 03:33:50,674 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:50,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 03:33:50,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash 926022, now seen corresponding path program 1 times [2023-02-17 03:33:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:50,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98855468] [2023-02-17 03:33:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:50,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98855468] [2023-02-17 03:33:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98855468] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:50,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:50,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:33:50,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11057201] [2023-02-17 03:33:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 03:33:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 03:33:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 03:33:50,862 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:50,879 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-02-17 03:33:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 03:33:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 03:33:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:50,885 INFO L225 Difference]: With dead ends: 23 [2023-02-17 03:33:50,885 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 03:33:50,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 03:33:50,888 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:50,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 03:33:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-17 03:33:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-02-17 03:33:50,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 4 [2023-02-17 03:33:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:50,908 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-02-17 03:33:50,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-02-17 03:33:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 03:33:50,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:50,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 03:33:50,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 03:33:50,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2023-02-17 03:33:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:50,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100399669] [2023-02-17 03:33:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100399669] [2023-02-17 03:33:50,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100399669] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:50,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:50,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:33:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343911682] [2023-02-17 03:33:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:50,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:33:50,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:33:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:50,953 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:50,979 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-02-17 03:33:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:33:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 03:33:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:50,980 INFO L225 Difference]: With dead ends: 27 [2023-02-17 03:33:50,982 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 03:33:50,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:50,984 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:50,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 03:33:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-17 03:33:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-17 03:33:50,989 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2023-02-17 03:33:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:50,989 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-17 03:33:50,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-17 03:33:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 03:33:50,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:50,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 03:33:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 03:33:50,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-17 03:33:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875964195] [2023-02-17 03:33:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:51,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875964195] [2023-02-17 03:33:51,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875964195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:51,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:51,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:33:51,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192947976] [2023-02-17 03:33:51,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:51,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:33:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:33:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:51,074 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:51,104 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-02-17 03:33:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:33:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 03:33:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:51,105 INFO L225 Difference]: With dead ends: 20 [2023-02-17 03:33:51,105 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 03:33:51,106 INFO L412 NwaCegarLoop]: 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 [2023-02-17 03:33:51,106 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:51,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 03:33:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2023-02-17 03:33:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-02-17 03:33:51,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2023-02-17 03:33:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:51,109 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-02-17 03:33:51,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-02-17 03:33:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 03:33:51,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:51,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 03:33:51,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 03:33:51,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:51,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2023-02-17 03:33:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:51,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761135601] [2023-02-17 03:33:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761135601] [2023-02-17 03:33:51,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761135601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:51,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:51,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:33:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121879669] [2023-02-17 03:33:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:51,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:33:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:33:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:51,207 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:51,236 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-02-17 03:33:51,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:33:51,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 03:33:51,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:51,237 INFO L225 Difference]: With dead ends: 22 [2023-02-17 03:33:51,238 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 03:33:51,239 INFO L412 NwaCegarLoop]: 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 [2023-02-17 03:33:51,240 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:51,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 03:33:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-02-17 03:33:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-02-17 03:33:51,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 4 [2023-02-17 03:33:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:51,261 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-02-17 03:33:51,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-02-17 03:33:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 03:33:51,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:51,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:51,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 03:33:51,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 264435860, now seen corresponding path program 1 times [2023-02-17 03:33:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:51,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441910899] [2023-02-17 03:33:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441910899] [2023-02-17 03:33:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441910899] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369307111] [2023-02-17 03:33:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:51,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:51,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:51,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:33:51,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 03:33:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:51,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:33:51,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369307111] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:51,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:51,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-17 03:33:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517034553] [2023-02-17 03:33:51,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:33:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:33:51,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:33:51,427 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:51,470 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-02-17 03:33:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:33:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 03:33:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:51,471 INFO L225 Difference]: With dead ends: 33 [2023-02-17 03:33:51,471 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 03:33:51,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:33:51,472 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:51,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 54 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 03:33:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-02-17 03:33:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-17 03:33:51,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 8 [2023-02-17 03:33:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:51,476 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-17 03:33:51,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-17 03:33:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 03:33:51,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:51,477 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:51,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 03:33:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:51,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:51,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 264435913, now seen corresponding path program 1 times [2023-02-17 03:33:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929435547] [2023-02-17 03:33:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:51,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929435547] [2023-02-17 03:33:51,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929435547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:51,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095083090] [2023-02-17 03:33:51,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:51,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:51,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:33:51,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 03:33:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:51,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:33:51,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:51,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 03:33:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:51,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095083090] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:51,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:51,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-02-17 03:33:51,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046187171] [2023-02-17 03:33:51,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:51,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:33:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:51,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:33:51,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:33:51,867 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:51,911 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-02-17 03:33:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:33:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 03:33:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:51,912 INFO L225 Difference]: With dead ends: 32 [2023-02-17 03:33:51,912 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 03:33:51,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:33:51,913 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:51,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 03:33:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 03:33:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-02-17 03:33:51,916 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 8 [2023-02-17 03:33:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:51,916 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-02-17 03:33:51,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-02-17 03:33:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 03:33:51,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:51,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1] [2023-02-17 03:33:51,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 03:33:52,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-17 03:33:52,134 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2061457123, now seen corresponding path program 2 times [2023-02-17 03:33:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:52,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273846817] [2023-02-17 03:33:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 03:33:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:52,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273846817] [2023-02-17 03:33:52,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273846817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:52,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:52,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:33:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072638846] [2023-02-17 03:33:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:52,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:33:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:33:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:33:52,221 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:52,230 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-02-17 03:33:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:33:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 03:33:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:52,233 INFO L225 Difference]: With dead ends: 30 [2023-02-17 03:33:52,233 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 03:33:52,233 INFO L412 NwaCegarLoop]: 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 [2023-02-17 03:33:52,234 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:52,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 03:33:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-17 03:33:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-02-17 03:33:52,241 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2023-02-17 03:33:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:52,241 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-02-17 03:33:52,241 INFO L496 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) [2023-02-17 03:33:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-02-17 03:33:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 03:33:52,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:52,242 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1] [2023-02-17 03:33:52,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 03:33:52,242 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2061457070, now seen corresponding path program 2 times [2023-02-17 03:33:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760513791] [2023-02-17 03:33:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760513791] [2023-02-17 03:33:52,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760513791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77927142] [2023-02-17 03:33:52,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:33:52,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:52,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:52,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:33:52,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 03:33:52,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:33:52,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:33:52,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:33:52,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:52,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 03:33:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:52,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:52,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77927142] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:52,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:52,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-02-17 03:33:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702710899] [2023-02-17 03:33:52,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:52,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 03:33:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 03:33:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:33:52,496 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:52,653 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2023-02-17 03:33:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:33:52,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 03:33:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:52,654 INFO L225 Difference]: With dead ends: 99 [2023-02-17 03:33:52,654 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 03:33:52,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2023-02-17 03:33:52,655 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 166 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:52,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 100 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:33:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 03:33:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2023-02-17 03:33:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2023-02-17 03:33:52,659 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 20 [2023-02-17 03:33:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:52,659 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2023-02-17 03:33:52,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2023-02-17 03:33:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:33:52,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:52,660 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:52,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 03:33:52,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:52,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1807984667, now seen corresponding path program 1 times [2023-02-17 03:33:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:52,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897320140] [2023-02-17 03:33:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:52,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897320140] [2023-02-17 03:33:52,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897320140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:52,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702714281] [2023-02-17 03:33:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:52,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:52,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:52,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:33:52,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 03:33:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:52,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:33:52,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:53,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:33:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:53,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702714281] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:33:53,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:33:53,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-02-17 03:33:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400969425] [2023-02-17 03:33:53,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:33:53,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:33:53,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:53,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:33:53,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:33:53,070 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:53,105 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2023-02-17 03:33:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:33:53,105 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-17 03:33:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:53,107 INFO L225 Difference]: With dead ends: 54 [2023-02-17 03:33:53,107 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 03:33:53,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:33:53,109 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:53,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 03:33:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-02-17 03:33:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2023-02-17 03:33:53,122 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 27 [2023-02-17 03:33:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:53,122 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2023-02-17 03:33:53,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2023-02-17 03:33:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 03:33:53,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:53,123 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1] [2023-02-17 03:33:53,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 03:33:53,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:53,329 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -256132636, now seen corresponding path program 3 times [2023-02-17 03:33:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:53,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112848097] [2023-02-17 03:33:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:53,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 163 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:33:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:53,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112848097] [2023-02-17 03:33:53,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112848097] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:33:53,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964088974] [2023-02-17 03:33:53,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 03:33:53,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:33:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:33:53,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:33:53,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 03:33:53,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 03:33:53,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:33:53,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:33:53,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:33:53,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 03:33:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-02-17 03:33:53,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:33:53,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964088974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:53,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:33:53,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2023-02-17 03:33:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460896441] [2023-02-17 03:33:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:53,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:33:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:33:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2023-02-17 03:33:53,612 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:53,631 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-02-17 03:33:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:33:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-17 03:33:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:53,632 INFO L225 Difference]: With dead ends: 53 [2023-02-17 03:33:53,632 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 03:33:53,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=158, Unknown=0, NotChecked=0, Total=272 [2023-02-17 03:33:53,633 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:53,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 16 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 03:33:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-02-17 03:33:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-17 03:33:53,635 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 44 [2023-02-17 03:33:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:53,635 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-17 03:33:53,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-17 03:33:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 03:33:53,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:53,637 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:53,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-17 03:33:53,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-17 03:33:53,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1707920246, now seen corresponding path program 2 times [2023-02-17 03:33:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:53,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962423339] [2023-02-17 03:33:53,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:33:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-17 03:33:53,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:33:53,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962423339] [2023-02-17 03:33:53,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962423339] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:33:53,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:33:53,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:33:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085318443] [2023-02-17 03:33:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:33:53,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:33:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:33:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:33:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:33:53,948 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:33:53,964 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2023-02-17 03:33:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:33:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-02-17 03:33:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:33:53,965 INFO L225 Difference]: With dead ends: 54 [2023-02-17 03:33:53,965 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 03:33:53,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:33:53,966 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:33:53,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:33:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 03:33:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-17 03:33:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2023-02-17 03:33:53,973 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 47 [2023-02-17 03:33:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:33:53,974 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2023-02-17 03:33:53,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:33:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2023-02-17 03:33:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 03:33:53,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:33:53,978 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:33:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 03:33:53,978 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-02-17 03:33:53,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:33:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1707912301, now seen corresponding path program 1 times [2023-02-17 03:33:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:33:53,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807981858] [2023-02-17 03:33:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:33:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:33:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:33:54,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 03:33:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:33:54,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 03:33:54,043 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 03:33:54,045 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (7 of 8 remaining) [2023-02-17 03:33:54,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2023-02-17 03:33:54,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2023-02-17 03:33:54,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2023-02-17 03:33:54,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2023-02-17 03:33:54,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 8 remaining) [2023-02-17 03:33:54,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 8 remaining) [2023-02-17 03:33:54,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2023-02-17 03:33:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 03:33:54,050 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1] [2023-02-17 03:33:54,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:33:54,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 03:33:54 BoogieIcfgContainer [2023-02-17 03:33:54,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 03:33:54,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 03:33:54,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 03:33:54,101 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 03:33:54,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:33:50" (3/4) ... [2023-02-17 03:33:54,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 03:33:54,142 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 03:33:54,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 03:33:54,143 INFO L158 Benchmark]: Toolchain (without parser) took 3954.35ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 111.5MB in the beginning and 96.5MB in the end (delta: 15.0MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,143 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:33:54,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 123.44ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 101.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.52ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,144 INFO L158 Benchmark]: Boogie Preprocessor took 22.95ms. Allocated memory is still 153.1MB. Free memory was 100.3MB in the beginning and 99.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,145 INFO L158 Benchmark]: RCFGBuilder took 216.11ms. Allocated memory is still 153.1MB. Free memory was 99.0MB in the beginning and 118.2MB in the end (delta: -19.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,145 INFO L158 Benchmark]: TraceAbstraction took 3523.77ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 117.4MB in the beginning and 99.6MB in the end (delta: 17.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,145 INFO L158 Benchmark]: Witness Printer took 42.19ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 96.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 03:33:54,149 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 123.44ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 101.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.52ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.95ms. Allocated memory is still 153.1MB. Free memory was 100.3MB in the beginning and 99.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 216.11ms. Allocated memory is still 153.1MB. Free memory was 99.0MB in the beginning and 118.2MB in the end (delta: -19.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3523.77ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 117.4MB in the beginning and 99.6MB in the end (delta: 17.7MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * Witness Printer took 42.19ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 96.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-1, alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-5, alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-6, alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-9, alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-10, alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L9] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L13] EXPR p[2] VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}, p[2]=97] [L13] COND TRUE p[2] == 'a' [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 156 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 344 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3172 SizeOfPredicates, 8 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 581/858 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 03:33:54,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)