./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-3.i --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/test-0158-3.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 56731b349541148adf5e7b09b4f62a37ef34decefedcd97d69429e6620dcb1d4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:49:12,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:49:12,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:49:12,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:49:12,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:49:12,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:49:12,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:49:12,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:49:12,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:49:12,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:49:12,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:49:12,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:49:12,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:49:12,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:49:12,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:49:12,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:49:12,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:49:12,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:49:12,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:49:12,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:49:12,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:49:12,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:49:12,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:49:12,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:49:12,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:49:12,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:49:12,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:49:12,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:49:12,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:49:12,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:49:12,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:49:12,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:49:12,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:49:12,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:49:12,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:49:12,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:49:12,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:49:12,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:49:12,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:49:12,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:49:12,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:49:12,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 02:49:12,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:49:12,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:49:12,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:49:12,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:49:12,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:49:12,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:49:12,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:49:12,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:49:12,790 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:49:12,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:49:12,791 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:49:12,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:49:12,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:49:12,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:49:12,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:49:12,791 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:49:12,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:49:12,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:49:12,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:49:12,792 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:49:12,792 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:49:12,792 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:49:12,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:49:12,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:49:12,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:49:12,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:12,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:49:12,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:49:12,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:49:12,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:49:12,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:49:12,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:49:12,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:49:12,794 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:49:12,794 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 -> 56731b349541148adf5e7b09b4f62a37ef34decefedcd97d69429e6620dcb1d4 [2023-02-17 02:49:12,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:49:13,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:49:13,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:49:13,012 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:49:13,012 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:49:13,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-3.i [2023-02-17 02:49:13,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:49:14,163 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:49:14,164 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-3.i [2023-02-17 02:49:14,175 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a92cbc39/c99bb810db924ca7b869c9407114436c/FLAG3566edcb8 [2023-02-17 02:49:14,185 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a92cbc39/c99bb810db924ca7b869c9407114436c [2023-02-17 02:49:14,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:49:14,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:49:14,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:14,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:49:14,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:49:14,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3371c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14, skipping insertion in model container [2023-02-17 02:49:14,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:49:14,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:49:14,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:14,477 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:49:14,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:49:14,534 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:49:14,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14 WrapperNode [2023-02-17 02:49:14,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:49:14,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:49:14,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:49:14,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:49:14,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,571 INFO L138 Inliner]: procedures = 174, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2023-02-17 02:49:14,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:49:14,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:49:14,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:49:14,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:49:14,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:49:14,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:49:14,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:49:14,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:49:14,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (1/1) ... [2023-02-17 02:49:14,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:49:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:49:14,617 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 02:49:14,619 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 02:49:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 02:49:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 02:49:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:49:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 02:49:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 02:49:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 02:49:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 02:49:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:49:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:49:14,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:49:14,715 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:49:14,716 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:49:14,842 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:49:14,846 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:49:14,847 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 02:49:14,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:14 BoogieIcfgContainer [2023-02-17 02:49:14,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:49:14,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:49:14,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:49:14,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:49:14,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:49:14" (1/3) ... [2023-02-17 02:49:14,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cd169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:49:14, skipping insertion in model container [2023-02-17 02:49:14,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:49:14" (2/3) ... [2023-02-17 02:49:14,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cd169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:49:14, skipping insertion in model container [2023-02-17 02:49:14,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:14" (3/3) ... [2023-02-17 02:49:14,870 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0158-3.i [2023-02-17 02:49:14,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:49:14,882 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-02-17 02:49:14,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:49:14,912 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;@6a9cba52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:49:14,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-02-17 02:49:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 17 states have (on average 2.0) internal successors, (34), 34 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 02:49:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-17 02:49:14,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:14,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-17 02:49:14,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-17 02:49:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:14,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777983725] [2023-02-17 02:49:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:15,137 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 02:49:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:15,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777983725] [2023-02-17 02:49:15,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777983725] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:15,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:15,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:15,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683794705] [2023-02-17 02:49:15,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:15,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:15,160 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 2.0) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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-17 02:49:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:15,195 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2023-02-17 02:49:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:15,197 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-17 02:49:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:15,202 INFO L225 Difference]: With dead ends: 30 [2023-02-17 02:49:15,202 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 02:49:15,203 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 02:49:15,205 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:15,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 02:49:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-17 02:49:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.6875) internal successors, (27), 27 states have internal predecessors, (27), 0 states have call successors, (0), 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 02:49:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2023-02-17 02:49:15,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3 [2023-02-17 02:49:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:15,223 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2023-02-17 02:49:15,224 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-17 02:49:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2023-02-17 02:49:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-17 02:49:15,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:15,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-17 02:49:15,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:49:15,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-17 02:49:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:15,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474709367] [2023-02-17 02:49:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:15,318 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 02:49:15,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:15,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474709367] [2023-02-17 02:49:15,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474709367] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:15,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:15,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:49:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322375725] [2023-02-17 02:49:15,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:15,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:49:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:49:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:49:15,321 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:15,344 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2023-02-17 02:49:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:49:15,344 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-17 02:49:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:15,344 INFO L225 Difference]: With dead ends: 23 [2023-02-17 02:49:15,344 INFO L226 Difference]: Without dead ends: 23 [2023-02-17 02:49:15,345 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 02:49:15,345 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:15,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-17 02:49:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 02:49:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 22 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 02:49:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2023-02-17 02:49:15,348 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 3 [2023-02-17 02:49:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:15,350 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2023-02-17 02:49:15,350 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-17 02:49:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2023-02-17 02:49:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:49:15,351 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:15,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:15,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:49:15,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1056666061, now seen corresponding path program 1 times [2023-02-17 02:49:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:15,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354749749] [2023-02-17 02:49:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:15,515 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 02:49:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354749749] [2023-02-17 02:49:15,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354749749] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:15,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:15,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394939173] [2023-02-17 02:49:15,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:15,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:15,517 INFO L87 Difference]: Start difference. First operand 23 states and 22 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-17 02:49:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:15,555 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2023-02-17 02:49:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:15,555 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-17 02:49:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:15,556 INFO L225 Difference]: With dead ends: 22 [2023-02-17 02:49:15,556 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 02:49:15,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:15,561 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:15,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 02:49:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 02:49:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 21 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 02:49:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2023-02-17 02:49:15,569 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 10 [2023-02-17 02:49:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:15,569 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2023-02-17 02:49:15,569 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-17 02:49:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2023-02-17 02:49:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 02:49:15,570 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:15,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:15,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:49:15,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1603090424, now seen corresponding path program 1 times [2023-02-17 02:49:15,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:15,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807791199] [2023-02-17 02:49:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:15,744 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 02:49:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:15,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807791199] [2023-02-17 02:49:15,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807791199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:15,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:15,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237408738] [2023-02-17 02:49:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:15,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:15,748 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 02:49:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:15,794 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2023-02-17 02:49:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:15,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 11 [2023-02-17 02:49:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:15,797 INFO L225 Difference]: With dead ends: 21 [2023-02-17 02:49:15,797 INFO L226 Difference]: Without dead ends: 21 [2023-02-17 02:49:15,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:15,804 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:15,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-17 02:49:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-17 02:49:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 20 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 02:49:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2023-02-17 02:49:15,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 11 [2023-02-17 02:49:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:15,809 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2023-02-17 02:49:15,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 02:49:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2023-02-17 02:49:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 02:49:15,810 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:15,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:15,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 02:49:15,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1843804463, now seen corresponding path program 1 times [2023-02-17 02:49:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:15,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633128972] [2023-02-17 02:49:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:15,922 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 02:49:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633128972] [2023-02-17 02:49:15,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633128972] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:15,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:15,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:49:15,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502225462] [2023-02-17 02:49:15,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:15,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:49:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:15,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:49:15,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:49:15,925 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-17 02:49:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:15,957 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2023-02-17 02:49:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:49:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) Word has length 12 [2023-02-17 02:49:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:15,958 INFO L225 Difference]: With dead ends: 20 [2023-02-17 02:49:15,958 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 02:49:15,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:49:15,959 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:15,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 02:49:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-17 02:49:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 19 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 02:49:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2023-02-17 02:49:15,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 12 [2023-02-17 02:49:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:15,965 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2023-02-17 02:49:15,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-17 02:49:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2023-02-17 02:49:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 02:49:15,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:15,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:15,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 02:49:15,969 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1323363562, now seen corresponding path program 1 times [2023-02-17 02:49:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534715891] [2023-02-17 02:49:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:16,074 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 02:49:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:16,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534715891] [2023-02-17 02:49:16,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534715891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:16,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:16,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876409484] [2023-02-17 02:49:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:16,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:16,077 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:16,105 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2023-02-17 02:49:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 02:49:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:16,107 INFO L225 Difference]: With dead ends: 19 [2023-02-17 02:49:16,107 INFO L226 Difference]: Without dead ends: 19 [2023-02-17 02:49:16,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:16,108 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:16,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-17 02:49:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-17 02:49:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.125) internal successors, (18), 18 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 02:49:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2023-02-17 02:49:16,118 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 13 [2023-02-17 02:49:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:16,118 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2023-02-17 02:49:16,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2023-02-17 02:49:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 02:49:16,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:16,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:16,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 02:49:16,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1925402479, now seen corresponding path program 1 times [2023-02-17 02:49:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:16,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806278091] [2023-02-17 02:49:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:49:16,216 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 02:49:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:49:16,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806278091] [2023-02-17 02:49:16,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806278091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:49:16,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:49:16,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:49:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684192882] [2023-02-17 02:49:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:49:16,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:49:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:49:16,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:49:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:49:16,219 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:49:16,250 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2023-02-17 02:49:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:49:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 02:49:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:49:16,251 INFO L225 Difference]: With dead ends: 18 [2023-02-17 02:49:16,251 INFO L226 Difference]: Without dead ends: 18 [2023-02-17 02:49:16,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:49:16,252 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:49:16,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:49:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-17 02:49:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-17 02:49:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2023-02-17 02:49:16,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 14 [2023-02-17 02:49:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:49:16,254 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2023-02-17 02:49:16,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 02:49:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2023-02-17 02:49:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 02:49:16,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:49:16,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:16,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 02:49:16,255 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-02-17 02:49:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:49:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 442065356, now seen corresponding path program 1 times [2023-02-17 02:49:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:49:16,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504410718] [2023-02-17 02:49:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:49:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:49:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 02:49:16,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 02:49:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 02:49:16,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 02:49:16,286 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 02:49:16,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (16 of 17 remaining) [2023-02-17 02:49:16,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-02-17 02:49:16,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2023-02-17 02:49:16,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-02-17 02:49:16,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-02-17 02:49:16,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-02-17 02:49:16,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (5 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (4 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (3 of 17 remaining) [2023-02-17 02:49:16,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (2 of 17 remaining) [2023-02-17 02:49:16,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (1 of 17 remaining) [2023-02-17 02:49:16,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2023-02-17 02:49:16,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 02:49:16,292 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:49:16,295 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:49:16,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:49:16 BoogieIcfgContainer [2023-02-17 02:49:16,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:49:16,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:49:16,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:49:16,309 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:49:16,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:49:14" (3/4) ... [2023-02-17 02:49:16,310 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 02:49:16,330 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:49:16,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:49:16,331 INFO L158 Benchmark]: Toolchain (without parser) took 2140.12ms. Allocated memory is still 146.8MB. Free memory was 110.0MB in the beginning and 69.1MB in the end (delta: 40.9MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,331 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:49:16,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.97ms. Allocated memory is still 146.8MB. Free memory was 109.6MB in the beginning and 90.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,332 INFO L158 Benchmark]: Boogie Preprocessor took 14.75ms. Allocated memory is still 146.8MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,332 INFO L158 Benchmark]: RCFGBuilder took 261.11ms. Allocated memory is still 146.8MB. Free memory was 87.3MB in the beginning and 75.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,332 INFO L158 Benchmark]: TraceAbstraction took 1444.40ms. Allocated memory is still 146.8MB. Free memory was 74.7MB in the beginning and 71.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,332 INFO L158 Benchmark]: Witness Printer took 22.25ms. Allocated memory is still 146.8MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:49:16,333 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 113.2MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.97ms. Allocated memory is still 146.8MB. Free memory was 109.6MB in the beginning and 90.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 146.8MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.75ms. Allocated memory is still 146.8MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.11ms. Allocated memory is still 146.8MB. Free memory was 87.3MB in the beginning and 75.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1444.40ms. Allocated memory is still 146.8MB. Free memory was 74.7MB in the beginning and 71.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 22.25ms. Allocated memory is still 146.8MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 655]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L642-L649] union { void *p0; struct { char c[2]; void *p1; void *p2; } str; } data; [L650] data.p0 = malloc(37U) VAL [data={8:0}, malloc(37U)={5:0}] [L651] data.str.p2 = &data VAL [data={8:0}] [L652] EXPR data.p0 VAL [data={8:0}, data.p0={5:0}] [L652] void *ptr = data.p0; [L653] data.str.c[1] = sizeof data.str.p1 VAL [data={8:0}, ptr={5:0}] [L654] EXPR data.p0 VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) VAL [data={8:0}, data.p0={5:0}, ptr={5:0}] [L654] free(data.p0) [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] [L655] free(ptr) VAL [data={8:0}, ptr={5:0}] [L655] free(ptr) VAL [data={8:0}, ptr={5: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: -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: -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: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 654]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 640]: 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, 35 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 85 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 40, 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.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 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-17 02:49:16,361 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)