./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/cmp-freed-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/cmp-freed-ptr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:00:54,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:00:54,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:00:54,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:00:54,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:00:54,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:00:54,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:00:54,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:00:54,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:00:54,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:00:54,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:00:54,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:00:54,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:00:54,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:00:54,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:00:54,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:00:54,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:00:54,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:00:54,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:00:54,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:00:54,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:00:54,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:00:54,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:00:54,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:00:54,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:00:54,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:00:54,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:00:54,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:00:54,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:00:54,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:00:54,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:00:54,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:00:54,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:00:54,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:00:54,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:00:54,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:00:54,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:00:54,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:00:54,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:00:54,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:00:54,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:00:54,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:00:54,223 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:00:54,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:00:54,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:00:54,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:00:54,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:00:54,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:00:54,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:00:54,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:00:54,228 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:00:54,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:00:54,229 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:00:54,229 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:00:54,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:00:54,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:00:54,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:00:54,230 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:00:54,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:00:54,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:00:54,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:00:54,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:00:54,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:00:54,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:00:54,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:00:54,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:00:54,232 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:00:54,232 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:00:54,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:00:54,232 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:00:54,233 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 -> 63302b5441ba85cd38f4ed3669bf40852137e8be39297cc19159731ba051a536 [2023-02-15 01:00:54,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:00:54,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:00:54,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:00:54,465 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:00:54,465 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:00:54,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2023-02-15 01:00:55,666 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:00:55,874 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:00:55,875 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/cmp-freed-ptr.i [2023-02-15 01:00:55,893 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5504c6b4/d16f675bb6e44e2e93f498b4e4a87763/FLAGfc7943f05 [2023-02-15 01:00:55,913 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5504c6b4/d16f675bb6e44e2e93f498b4e4a87763 [2023-02-15 01:00:55,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:00:55,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:00:55,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:00:55,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:00:55,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:00:55,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:00:55" (1/1) ... [2023-02-15 01:00:55,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768036f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:55, skipping insertion in model container [2023-02-15 01:00:55,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:00:55" (1/1) ... [2023-02-15 01:00:55,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:00:55,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:00:56,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:00:56,262 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:00:56,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:00:56,306 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:00:56,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56 WrapperNode [2023-02-15 01:00:56,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:00:56,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:00:56,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:00:56,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:00:56,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,350 INFO L138 Inliner]: procedures = 112, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2023-02-15 01:00:56,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:00:56,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:00:56,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:00:56,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:00:56,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,402 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:00:56,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:00:56,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:00:56,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:00:56,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (1/1) ... [2023-02-15 01:00:56,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:00:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:00:56,451 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-15 01:00:56,474 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-15 01:00:56,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:00:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:00:56,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:00:56,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:00:56,565 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:00:56,566 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:00:56,671 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:00:56,675 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:00:56,675 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 01:00:56,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:00:56 BoogieIcfgContainer [2023-02-15 01:00:56,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:00:56,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:00:56,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:00:56,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:00:56,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:00:55" (1/3) ... [2023-02-15 01:00:56,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae90d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:00:56, skipping insertion in model container [2023-02-15 01:00:56,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:00:56" (2/3) ... [2023-02-15 01:00:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae90d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:00:56, skipping insertion in model container [2023-02-15 01:00:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:00:56" (3/3) ... [2023-02-15 01:00:56,695 INFO L112 eAbstractionObserver]: Analyzing ICFG cmp-freed-ptr.i [2023-02-15 01:00:56,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:00:56,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-02-15 01:00:56,825 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:00:56,832 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;@3b6bebc0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:00:56,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-02-15 01:00:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 24 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-15 01:00:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 01:00:56,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:56,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 01:00:56,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2023-02-15 01:00:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:56,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950330048] [2023-02-15 01:00:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,044 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-15 01:00:57,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950330048] [2023-02-15 01:00:57,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950330048] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:00:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668139346] [2023-02-15 01:00:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:00:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:00:57,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:00:57,094 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 24 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,123 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2023-02-15 01:00:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:00:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 01:00:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,132 INFO L225 Difference]: With dead ends: 24 [2023-02-15 01:00:57,132 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 01:00:57,134 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-15 01:00:57,137 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:57,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 01:00:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 01:00:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 21 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-15 01:00:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2023-02-15 01:00:57,165 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 3 [2023-02-15 01:00:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,165 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2023-02-15 01:00:57,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2023-02-15 01:00:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:00:57,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:00:57,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:00:57,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2023-02-15 01:00:57,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319229759] [2023-02-15 01:00:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,212 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-15 01:00:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319229759] [2023-02-15 01:00:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319229759] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:00:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916481858] [2023-02-15 01:00:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:00:57,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:00:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:00:57,217 INFO L87 Difference]: Start difference. First operand 22 states and 22 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-15 01:00:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,248 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2023-02-15 01:00:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:00:57,249 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-15 01:00:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,249 INFO L225 Difference]: With dead ends: 21 [2023-02-15 01:00:57,250 INFO L226 Difference]: Without dead ends: 21 [2023-02-15 01:00:57,250 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-15 01:00:57,251 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:57,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-15 01:00:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 01:00:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2023-02-15 01:00:57,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 4 [2023-02-15 01:00:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,257 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2023-02-15 01:00:57,257 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-15 01:00:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2023-02-15 01:00:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:00:57,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:00:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:00:57,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2023-02-15 01:00:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869552497] [2023-02-15 01:00:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,358 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-15 01:00:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869552497] [2023-02-15 01:00:57,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869552497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:00:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305077454] [2023-02-15 01:00:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:00:57,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:00:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:00:57,363 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,382 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2023-02-15 01:00:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:00:57,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 01:00:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,383 INFO L225 Difference]: With dead ends: 20 [2023-02-15 01:00:57,383 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 01:00:57,383 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-15 01:00:57,384 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 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-15 01:00:57,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 01:00:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-15 01:00:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 19 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-15 01:00:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2023-02-15 01:00:57,388 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 5 [2023-02-15 01:00:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,388 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2023-02-15 01:00:57,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2023-02-15 01:00:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:00:57,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:57,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:00:57,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949765, now seen corresponding path program 1 times [2023-02-15 01:00:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926697442] [2023-02-15 01:00:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,423 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-15 01:00:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926697442] [2023-02-15 01:00:57,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926697442] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:00:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703330040] [2023-02-15 01:00:57,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:00:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:00:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:00:57,425 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,437 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-02-15 01:00:57,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:00:57,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 01:00:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,440 INFO L225 Difference]: With dead ends: 18 [2023-02-15 01:00:57,441 INFO L226 Difference]: Without dead ends: 18 [2023-02-15 01:00:57,441 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-15 01:00:57,443 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:57,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-15 01:00:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-15 01:00:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 17 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-15 01:00:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-02-15 01:00:57,446 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2023-02-15 01:00:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,447 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-02-15 01:00:57,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-02-15 01:00:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 01:00:57,447 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:57,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:00:57,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash 87867921, now seen corresponding path program 1 times [2023-02-15 01:00:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992175526] [2023-02-15 01:00:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,480 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-15 01:00:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992175526] [2023-02-15 01:00:57,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992175526] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:00:57,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884610824] [2023-02-15 01:00:57,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:00:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:00:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:00:57,483 INFO L87 Difference]: Start difference. First operand 18 states and 18 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-15 01:00:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,496 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-02-15 01:00:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:00:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 01:00:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,497 INFO L225 Difference]: With dead ends: 16 [2023-02-15 01:00:57,497 INFO L226 Difference]: Without dead ends: 16 [2023-02-15 01:00:57,498 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-15 01:00:57,499 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:57,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-15 01:00:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-15 01:00:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-02-15 01:00:57,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2023-02-15 01:00:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,504 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-02-15 01:00:57,504 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-15 01:00:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-02-15 01:00:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:00:57,504 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:57,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:00:57,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1571061689, now seen corresponding path program 1 times [2023-02-15 01:00:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795286721] [2023-02-15 01:00:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,605 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-15 01:00:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795286721] [2023-02-15 01:00:57,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795286721] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:00:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607184792] [2023-02-15 01:00:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:00:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:00:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:00:57,607 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-15 01:00:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,635 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2023-02-15 01:00:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:00:57,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-02-15 01:00:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,636 INFO L225 Difference]: With dead ends: 18 [2023-02-15 01:00:57,636 INFO L226 Difference]: Without dead ends: 18 [2023-02-15 01:00:57,636 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-15 01:00:57,641 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:57,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-15 01:00:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-15 01:00:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.125) internal successors, (18), 17 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-15 01:00:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2023-02-15 01:00:57,654 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2023-02-15 01:00:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,655 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2023-02-15 01:00:57,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-15 01:00:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2023-02-15 01:00:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 01:00:57,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:57,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:00:57,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1458272044, now seen corresponding path program 1 times [2023-02-15 01:00:57,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026291204] [2023-02-15 01:00:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:57,789 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-15 01:00:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:00:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026291204] [2023-02-15 01:00:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026291204] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:00:57,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:00:57,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:00:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323318698] [2023-02-15 01:00:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:00:57,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:00:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:00:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:00:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:00:57,791 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:57,842 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-02-15 01:00:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:00:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 01:00:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:57,844 INFO L225 Difference]: With dead ends: 17 [2023-02-15 01:00:57,844 INFO L226 Difference]: Without dead ends: 13 [2023-02-15 01:00:57,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:00:57,845 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:57,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:00:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-02-15 01:00:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-15 01:00:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 01:00:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2023-02-15 01:00:57,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 10 [2023-02-15 01:00:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:57,851 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2023-02-15 01:00:57,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2023-02-15 01:00:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:00:57,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:57,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:57,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:00:57,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2023-02-15 01:00:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash -16437808, now seen corresponding path program 1 times [2023-02-15 01:00:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:00:57,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452838795] [2023-02-15 01:00:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:00:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:00:57,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 01:00:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 01:00:57,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 01:00:57,885 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 01:00:57,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 10 remaining) [2023-02-15 01:00:57,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (8 of 10 remaining) [2023-02-15 01:00:57,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (7 of 10 remaining) [2023-02-15 01:00:57,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 10 remaining) [2023-02-15 01:00:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 10 remaining) [2023-02-15 01:00:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 10 remaining) [2023-02-15 01:00:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2023-02-15 01:00:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2023-02-15 01:00:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2023-02-15 01:00:57,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-02-15 01:00:57,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:00:57,891 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:57,893 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:00:57,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:00:57 BoogieIcfgContainer [2023-02-15 01:00:57,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:00:57,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:00:57,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:00:57,907 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:00:57,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:00:56" (3/4) ... [2023-02-15 01:00:57,908 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 01:00:57,932 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 01:00:57,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:00:57,933 INFO L158 Benchmark]: Toolchain (without parser) took 2016.48ms. Allocated memory is still 146.8MB. Free memory was 78.5MB in the beginning and 117.2MB in the end (delta: -38.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,933 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 92.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:00:57,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.02ms. Allocated memory is still 146.8MB. Free memory was 78.4MB in the beginning and 63.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 146.8MB. Free memory was 63.0MB in the beginning and 61.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,934 INFO L158 Benchmark]: Boogie Preprocessor took 50.03ms. Allocated memory is still 146.8MB. Free memory was 61.2MB in the beginning and 60.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,934 INFO L158 Benchmark]: RCFGBuilder took 268.99ms. Allocated memory is still 146.8MB. Free memory was 60.0MB in the beginning and 116.1MB in the end (delta: -56.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,934 INFO L158 Benchmark]: TraceAbstraction took 1219.18ms. Allocated memory is still 146.8MB. Free memory was 115.7MB in the beginning and 42.2MB in the end (delta: 73.5MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,934 INFO L158 Benchmark]: Witness Printer took 26.06ms. Allocated memory is still 146.8MB. Free memory was 42.2MB in the beginning and 117.2MB in the end (delta: -74.9MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-02-15 01:00:57,935 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.15ms. Allocated memory is still 107.0MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 92.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.02ms. Allocated memory is still 146.8MB. Free memory was 78.4MB in the beginning and 63.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 146.8MB. Free memory was 63.0MB in the beginning and 61.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.03ms. Allocated memory is still 146.8MB. Free memory was 61.2MB in the beginning and 60.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.99ms. Allocated memory is still 146.8MB. Free memory was 60.0MB in the beginning and 116.1MB in the end (delta: -56.1MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1219.18ms. Allocated memory is still 146.8MB. Free memory was 115.7MB in the beginning and 42.2MB in the end (delta: 73.5MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 26.06ms. Allocated memory is still 146.8MB. Free memory was 42.2MB in the beginning and 117.2MB in the end (delta: -74.9MB). Peak memory consumption was 4.4MB. 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: 554]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L543] struct T* x = ((void *)0); [L544] struct T* y = ((void *)0); [L545] y = malloc(sizeof(*y)) [L546] intptr_t adressY = (intptr_t) y; VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) VAL [adressY=2, x={0:0}, y={2:0}] [L547] free(y) [L548] x = malloc(sizeof(*x)) [L549] intptr_t adressX = (intptr_t) x; VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L550] COND TRUE adressX == adressY VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L552] free(x) [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] [L554] free(x) VAL [adressX=2, adressY=2, x={2:0}, y={2:0}] - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: 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, 25 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 98 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 01:00:57,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)