./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 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/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 14:02:25,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 14:02:25,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 14:02:25,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 14:02:25,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 14:02:25,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 14:02:25,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 14:02:25,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 14:02:25,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 14:02:25,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 14:02:25,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 14:02:25,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 14:02:25,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 14:02:25,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 14:02:25,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 14:02:25,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 14:02:25,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 14:02:25,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 14:02:25,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 14:02:25,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 14:02:25,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 14:02:25,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 14:02:25,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 14:02:25,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 14:02:25,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 14:02:25,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 14:02:25,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 14:02:25,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 14:02:25,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 14:02:25,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 14:02:25,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 14:02:25,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 14:02:25,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 14:02:25,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 14:02:25,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 14:02:25,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 14:02:25,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 14:02:25,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 14:02:25,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 14:02:25,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 14:02:25,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 14:02:25,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 14:02:25,646 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 14:02:25,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 14:02:25,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 14:02:25,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 14:02:25,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 14:02:25,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 14:02:25,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 14:02:25,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 14:02:25,651 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 14:02:25,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 14:02:25,652 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 14:02:25,652 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 14:02:25,653 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 14:02:25,654 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 14:02:25,654 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 14:02:25,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 14:02:25,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 14:02:25,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 14:02:25,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 14:02:25,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 14:02:25,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 14:02:25,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 14:02:25,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 14:02:25,655 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 14:02:25,655 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 14:02:25,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 14:02:25,655 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 14:02:25,656 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 -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2023-02-14 14:02:25,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 14:02:25,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 14:02:25,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 14:02:25,834 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 14:02:25,835 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 14:02:25,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-02-14 14:02:26,787 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 14:02:27,014 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 14:02:27,014 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-02-14 14:02:27,018 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5cb433b/aadb63e981334c8f8e9ed73d9ac4f32c/FLAGb1c98206b [2023-02-14 14:02:27,032 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5cb433b/aadb63e981334c8f8e9ed73d9ac4f32c [2023-02-14 14:02:27,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 14:02:27,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 14:02:27,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 14:02:27,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 14:02:27,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 14:02:27,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca17c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27, skipping insertion in model container [2023-02-14 14:02:27,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 14:02:27,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 14:02:27,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:02:27,168 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 14:02:27,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:02:27,187 INFO L208 MainTranslator]: Completed translation [2023-02-14 14:02:27,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27 WrapperNode [2023-02-14 14:02:27,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 14:02:27,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 14:02:27,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 14:02:27,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 14:02:27,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,214 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2023-02-14 14:02:27,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 14:02:27,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 14:02:27,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 14:02:27,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 14:02:27,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 14:02:27,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 14:02:27,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 14:02:27,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 14:02:27,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (1/1) ... [2023-02-14 14:02:27,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 14:02:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:27,294 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-14 14:02:27,298 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-14 14:02:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 14:02:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 14:02:27,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 14:02:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 14:02:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 14:02:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 14:02:27,379 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 14:02:27,380 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 14:02:27,645 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 14:02:27,655 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 14:02:27,655 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 14:02:27,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:02:27 BoogieIcfgContainer [2023-02-14 14:02:27,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 14:02:27,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 14:02:27,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 14:02:27,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 14:02:27,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:02:27" (1/3) ... [2023-02-14 14:02:27,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c006a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:02:27, skipping insertion in model container [2023-02-14 14:02:27,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:02:27" (2/3) ... [2023-02-14 14:02:27,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c006a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:02:27, skipping insertion in model container [2023-02-14 14:02:27,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:02:27" (3/3) ... [2023-02-14 14:02:27,663 INFO L112 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2023-02-14 14:02:27,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 14:02:27,696 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-14 14:02:27,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 14:02:27,745 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;@2061ef38, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 14:02:27,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-14 14:02:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 14:02:27,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:27,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 14:02:27,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-14 14:02:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:27,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195921077] [2023-02-14 14:02:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:28,123 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-14 14:02:28,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:28,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195921077] [2023-02-14 14:02:28,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195921077] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:28,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:28,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797368192] [2023-02-14 14:02:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:28,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:28,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:28,156 INFO L87 Difference]: Start difference. First operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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-14 14:02:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:28,230 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2023-02-14 14:02:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:28,235 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-14 14:02:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:28,240 INFO L225 Difference]: With dead ends: 52 [2023-02-14 14:02:28,241 INFO L226 Difference]: Without dead ends: 50 [2023-02-14 14:02:28,242 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-14 14:02:28,246 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:28,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 14:02:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-14 14:02:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-14 14:02:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-14 14:02:28,271 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2023-02-14 14:02:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:28,271 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-14 14:02:28,272 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-14 14:02:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-14 14:02:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 14:02:28,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:28,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 14:02:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 14:02:28,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-14 14:02:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:28,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749755278] [2023-02-14 14:02:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:28,445 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-14 14:02:28,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:28,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749755278] [2023-02-14 14:02:28,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749755278] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:28,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:28,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:28,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163376495] [2023-02-14 14:02:28,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:28,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:28,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:28,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:28,450 INFO L87 Difference]: Start difference. First operand 50 states and 53 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-14 14:02:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:28,506 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2023-02-14 14:02:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:28,507 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-14 14:02:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:28,508 INFO L225 Difference]: With dead ends: 46 [2023-02-14 14:02:28,508 INFO L226 Difference]: Without dead ends: 46 [2023-02-14 14:02:28,509 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-14 14:02:28,510 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:28,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 14:02:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-14 14:02:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-14 14:02:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.130434782608696) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 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-14 14:02:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-02-14 14:02:28,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2023-02-14 14:02:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:28,518 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-02-14 14:02:28,518 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-14 14:02:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-02-14 14:02:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 14:02:28,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:28,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 14:02:28,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 14:02:28,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:28,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2023-02-14 14:02:28,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:28,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251817000] [2023-02-14 14:02:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:28,594 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-14 14:02:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:28,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251817000] [2023-02-14 14:02:28,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251817000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:28,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:28,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:28,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779655845] [2023-02-14 14:02:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:28,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:28,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:28,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:28,597 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:28,628 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2023-02-14 14:02:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-14 14:02:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:28,629 INFO L225 Difference]: With dead ends: 42 [2023-02-14 14:02:28,629 INFO L226 Difference]: Without dead ends: 42 [2023-02-14 14:02:28,629 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-14 14:02:28,630 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:28,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-14 14:02:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-02-14 14:02:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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-14 14:02:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-02-14 14:02:28,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2023-02-14 14:02:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:28,634 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-02-14 14:02:28,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-02-14 14:02:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 14:02:28,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:28,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 14:02:28,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 14:02:28,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2023-02-14 14:02:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:28,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100123507] [2023-02-14 14:02:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:28,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:28,704 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-14 14:02:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:28,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100123507] [2023-02-14 14:02:28,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100123507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:28,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:28,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117229953] [2023-02-14 14:02:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:28,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:28,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:28,707 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:28,729 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-02-14 14:02:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:28,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-14 14:02:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:28,730 INFO L225 Difference]: With dead ends: 38 [2023-02-14 14:02:28,730 INFO L226 Difference]: Without dead ends: 38 [2023-02-14 14:02:28,731 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-14 14:02:28,731 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:28,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-14 14:02:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-14 14:02:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 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-14 14:02:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-02-14 14:02:28,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2023-02-14 14:02:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:28,735 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-02-14 14:02:28,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-02-14 14:02:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 14:02:28,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:28,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 14:02:28,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 14:02:28,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2023-02-14 14:02:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:28,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005632215] [2023-02-14 14:02:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005632215] [2023-02-14 14:02:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005632215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:28,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:28,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815843498] [2023-02-14 14:02:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:28,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:28,792 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:28,815 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-02-14 14:02:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 14:02:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:28,816 INFO L225 Difference]: With dead ends: 34 [2023-02-14 14:02:28,816 INFO L226 Difference]: Without dead ends: 34 [2023-02-14 14:02:28,816 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-14 14:02:28,817 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:28,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-14 14:02:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-14 14:02:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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-14 14:02:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-02-14 14:02:28,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2023-02-14 14:02:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:28,834 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-02-14 14:02:28,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2023-02-14 14:02:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 14:02:28,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:28,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 14:02:28,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 14:02:28,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2023-02-14 14:02:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:28,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997950981] [2023-02-14 14:02:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:28,917 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-14 14:02:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:28,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997950981] [2023-02-14 14:02:28,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997950981] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:28,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:28,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843841208] [2023-02-14 14:02:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:28,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:28,920 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:28,953 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-02-14 14:02:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:28,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 14:02:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:28,956 INFO L225 Difference]: With dead ends: 30 [2023-02-14 14:02:28,956 INFO L226 Difference]: Without dead ends: 30 [2023-02-14 14:02:28,956 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-14 14:02:28,959 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:28,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-14 14:02:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-14 14:02:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-14 14:02:28,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2023-02-14 14:02:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:28,968 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-14 14:02:28,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-14 14:02:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 14:02:28,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:28,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:02:28,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 14:02:28,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2023-02-14 14:02:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:28,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599827891] [2023-02-14 14:02:28,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:29,007 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-14 14:02:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:29,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599827891] [2023-02-14 14:02:29,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599827891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:29,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:29,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:29,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828190565] [2023-02-14 14:02:29,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:29,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:29,010 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-14 14:02:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:29,032 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-02-14 14:02:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:29,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-14 14:02:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:29,035 INFO L225 Difference]: With dead ends: 27 [2023-02-14 14:02:29,035 INFO L226 Difference]: Without dead ends: 27 [2023-02-14 14:02:29,035 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-14 14:02:29,036 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:29,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-14 14:02:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-14 14:02:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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-14 14:02:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-14 14:02:29,051 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2023-02-14 14:02:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:29,051 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-14 14:02:29,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-14 14:02:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-14 14:02:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 14:02:29,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:29,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:02:29,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 14:02:29,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2023-02-14 14:02:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423369649] [2023-02-14 14:02:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:29,120 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-14 14:02:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:29,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423369649] [2023-02-14 14:02:29,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423369649] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:29,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:29,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:02:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900316118] [2023-02-14 14:02:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:29,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:02:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:02:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:02:29,122 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-14 14:02:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:29,137 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-02-14 14:02:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:02:29,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-14 14:02:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:29,139 INFO L225 Difference]: With dead ends: 24 [2023-02-14 14:02:29,139 INFO L226 Difference]: Without dead ends: 24 [2023-02-14 14:02:29,139 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-14 14:02:29,139 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:29,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-14 14:02:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-14 14:02:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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-14 14:02:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-14 14:02:29,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2023-02-14 14:02:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:29,142 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-14 14:02:29,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-14 14:02:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-14 14:02:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 14:02:29,142 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:29,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:29,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 14:02:29,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2023-02-14 14:02:29,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:29,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491812918] [2023-02-14 14:02:29,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:29,178 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-14 14:02:29,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491812918] [2023-02-14 14:02:29,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491812918] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:29,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:29,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 14:02:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397608038] [2023-02-14 14:02:29,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:29,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 14:02:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 14:02:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 14:02:29,180 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:29,213 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-14 14:02:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 14:02:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 14:02:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:29,214 INFO L225 Difference]: With dead ends: 39 [2023-02-14 14:02:29,214 INFO L226 Difference]: Without dead ends: 39 [2023-02-14 14:02:29,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 14:02:29,215 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:29,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-14 14:02:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2023-02-14 14:02:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-02-14 14:02:29,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2023-02-14 14:02:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:29,217 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-02-14 14:02:29,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-02-14 14:02:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 14:02:29,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:29,218 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:29,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 14:02:29,219 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2023-02-14 14:02:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:29,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575996870] [2023-02-14 14:02:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:29,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575996870] [2023-02-14 14:02:29,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575996870] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:02:29,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348915454] [2023-02-14 14:02:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:29,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:02:29,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 14:02:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:29,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 14:02:29,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:02:29,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-14 14:02:29,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:02:29,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 14:02:29,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:02:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:29,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:02:31,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:31,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-02-14 14:02:31,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-02-14 14:02:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:31,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348915454] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:02:31,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:02:31,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-02-14 14:02:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183074651] [2023-02-14 14:02:31,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:02:31,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 14:02:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:31,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 14:02:31,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2023-02-14 14:02:31,666 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-14 14:02:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:31,735 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-02-14 14:02:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 14:02:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) Word has length 15 [2023-02-14 14:02:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:31,736 INFO L225 Difference]: With dead ends: 41 [2023-02-14 14:02:31,736 INFO L226 Difference]: Without dead ends: 41 [2023-02-14 14:02:31,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2023-02-14 14:02:31,737 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:31,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 14:02:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-14 14:02:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2023-02-14 14:02:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-02-14 14:02:31,743 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2023-02-14 14:02:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:31,744 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-02-14 14:02:31,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-14 14:02:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-02-14 14:02:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 14:02:31,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:31,745 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:31,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 14:02:31,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-14 14:02:31,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2023-02-14 14:02:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:31,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937211667] [2023-02-14 14:02:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:32,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937211667] [2023-02-14 14:02:32,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937211667] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:32,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:02:32,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 14:02:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163782018] [2023-02-14 14:02:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:32,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 14:02:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 14:02:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 14:02:32,423 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-14 14:02:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:32,726 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-02-14 14:02:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 14:02:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-14 14:02:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:32,727 INFO L225 Difference]: With dead ends: 55 [2023-02-14 14:02:32,727 INFO L226 Difference]: Without dead ends: 55 [2023-02-14 14:02:32,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-14 14:02:32,727 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:32,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 72 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 14:02:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-14 14:02:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2023-02-14 14:02:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 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-14 14:02:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-02-14 14:02:32,729 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2023-02-14 14:02:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:32,729 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-02-14 14:02:32,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-14 14:02:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-02-14 14:02:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 14:02:32,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:32,730 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:32,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 14:02:32,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2023-02-14 14:02:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:32,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132800649] [2023-02-14 14:02:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 14:02:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:33,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132800649] [2023-02-14 14:02:33,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132800649] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:02:33,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146936701] [2023-02-14 14:02:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:33,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:33,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:33,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:02:33,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 14:02:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:33,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 14:02:33,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:02:33,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2023-02-14 14:02:33,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:02:33,243 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 14:02:33,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 14:02:33,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 14:02:33,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:02:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:33,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:02:39,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2023-02-14 14:02:39,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-02-14 14:02:39,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-02-14 14:02:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:39,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146936701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:02:39,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:02:39,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-02-14 14:02:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186714579] [2023-02-14 14:02:39,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:02:39,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-14 14:02:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-14 14:02:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=353, Unknown=18, NotChecked=0, Total=462 [2023-02-14 14:02:39,537 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:41,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 14:02:43,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 14:02:45,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 14:02:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:48,027 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-02-14 14:02:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 14:02:48,027 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 14:02:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:48,027 INFO L225 Difference]: With dead ends: 45 [2023-02-14 14:02:48,027 INFO L226 Difference]: Without dead ends: 45 [2023-02-14 14:02:48,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=298, Invalid=803, Unknown=21, NotChecked=0, Total=1122 [2023-02-14 14:02:48,028 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 100 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:48,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 66 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 6.2s Time] [2023-02-14 14:02:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-14 14:02:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2023-02-14 14:02:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-14 14:02:48,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2023-02-14 14:02:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:48,030 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-14 14:02:48,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:02:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-14 14:02:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 14:02:48,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:48,030 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:48,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-14 14:02:48,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-14 14:02:48,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2023-02-14 14:02:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:48,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169387529] [2023-02-14 14:02:48,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 14:02:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:48,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169387529] [2023-02-14 14:02:48,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169387529] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:02:48,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391571990] [2023-02-14 14:02:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:48,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:48,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:48,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:02:48,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 14:02:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:48,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-14 14:02:48,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:02:48,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2023-02-14 14:02:49,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:02:49,071 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 14:02:49,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 14:02:49,184 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 14:02:49,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 14:02:49,222 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 14:02:49,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 14:02:49,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 14:02:49,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:02:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:49,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:02:49,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2023-02-14 14:02:49,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:49,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2023-02-14 14:02:49,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:49,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 390 treesize of output 382 [2023-02-14 14:02:49,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 344 [2023-02-14 14:02:49,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 346 [2023-02-14 14:02:49,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 238 [2023-02-14 14:02:49,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 111 [2023-02-14 14:02:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:49,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391571990] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:02:49,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:02:49,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2023-02-14 14:02:49,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112073184] [2023-02-14 14:02:49,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:02:49,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 14:02:49,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:49,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 14:02:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=605, Unknown=17, NotChecked=52, Total=812 [2023-02-14 14:02:49,936 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 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-14 14:02:50,657 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 1)) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2023-02-14 14:02:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:53,743 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2023-02-14 14:02:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 14:02:53,744 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2023-02-14 14:02:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:53,744 INFO L225 Difference]: With dead ends: 93 [2023-02-14 14:02:53,744 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 14:02:53,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=518, Invalid=1598, Unknown=54, NotChecked=182, Total=2352 [2023-02-14 14:02:53,746 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 99 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 67 mSolverCounterUnsat, 84 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 84 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:53,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 196 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 399 Invalid, 84 Unknown, 55 Unchecked, 1.0s Time] [2023-02-14 14:02:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 14:02:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2023-02-14 14:02:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 0 states have call successors, (0), 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-14 14:02:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-02-14 14:02:53,748 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 26 [2023-02-14 14:02:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:53,748 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-02-14 14:02:53,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 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-14 14:02:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-02-14 14:02:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 14:02:53,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:53,748 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:53,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 14:02:53,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:53,949 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2023-02-14 14:02:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:53,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815911861] [2023-02-14 14:02:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815911861] [2023-02-14 14:02:54,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815911861] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:02:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256902654] [2023-02-14 14:02:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:54,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:02:54,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 14:02:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:54,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-14 14:02:54,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:02:54,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:02:54,513 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 14:02:54,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 14:02:54,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:02:54,595 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 14:02:54,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-02-14 14:02:54,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:02:54,750 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-02-14 14:02:54,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2023-02-14 14:02:54,864 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 14:02:54,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 14:02:54,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:02:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:54,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:02:55,022 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (not (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)))) is different from false [2023-02-14 14:02:55,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:55,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2023-02-14 14:02:55,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2023-02-14 14:02:55,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:55,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 81 [2023-02-14 14:02:55,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:55,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-02-14 14:02:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:55,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256902654] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:02:55,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:02:55,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 23 [2023-02-14 14:02:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898799182] [2023-02-14 14:02:55,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:02:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 14:02:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 14:02:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=359, Unknown=12, NotChecked=40, Total=506 [2023-02-14 14:02:55,122 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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-14 14:02:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:55,363 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-02-14 14:02:55,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 14:02:55,364 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 14:02:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:55,364 INFO L225 Difference]: With dead ends: 114 [2023-02-14 14:02:55,364 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 14:02:55,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=502, Unknown=13, NotChecked=50, Total=756 [2023-02-14 14:02:55,365 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 137 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 46 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:55,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 75 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 115 Invalid, 5 Unknown, 41 Unchecked, 0.1s Time] [2023-02-14 14:02:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 14:02:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-02-14 14:02:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 107 states have internal predecessors, (128), 0 states have call successors, (0), 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-14 14:02:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2023-02-14 14:02:55,367 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 27 [2023-02-14 14:02:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:55,367 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2023-02-14 14:02:55,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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-14 14:02:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2023-02-14 14:02:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 14:02:55,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:55,368 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:55,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 14:02:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:55,590 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash -825476096, now seen corresponding path program 1 times [2023-02-14 14:02:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:55,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682443970] [2023-02-14 14:02:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:02:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:55,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682443970] [2023-02-14 14:02:55,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682443970] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:02:55,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897393714] [2023-02-14 14:02:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:55,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:55,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:02:55,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 14:02:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:55,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 14:02:55,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:02:56,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:02:56,094 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-02-14 14:02:56,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2023-02-14 14:02:56,141 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 14:02:56,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2023-02-14 14:02:56,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 14:02:56,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-14 14:02:56,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-14 14:02:56,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-02-14 14:02:56,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:02:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 14:02:56,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:02:56,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_575))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))))) is different from false [2023-02-14 14:02:56,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_575))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))))) is different from false [2023-02-14 14:02:56,505 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_#t~mem6#1| 0) (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_574) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_575))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.base|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)))))) is different from false [2023-02-14 14:02:56,618 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-02-14 14:02:56,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 77 [2023-02-14 14:02:56,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:56,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 655 treesize of output 647 [2023-02-14 14:02:56,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:56,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 675 treesize of output 643 [2023-02-14 14:02:56,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:56,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 571 treesize of output 551 [2023-02-14 14:02:56,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-14 14:02:57,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 14:02:57,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 14:02:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2023-02-14 14:02:57,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897393714] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:02:57,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 14:02:57,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2023-02-14 14:02:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817937393] [2023-02-14 14:02:57,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 14:02:57,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 14:02:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 14:02:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=552, Unknown=16, NotChecked=150, Total=812 [2023-02-14 14:02:57,390 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 29 states have internal predecessors, (93), 0 states have call successors, (0), 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-14 14:02:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:58,578 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2023-02-14 14:02:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 14:02:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 29 states have internal predecessors, (93), 0 states have call successors, (0), 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 38 [2023-02-14 14:02:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:58,579 INFO L225 Difference]: With dead ends: 135 [2023-02-14 14:02:58,579 INFO L226 Difference]: Without dead ends: 135 [2023-02-14 14:02:58,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=636, Invalid=2011, Unknown=17, NotChecked=306, Total=2970 [2023-02-14 14:02:58,581 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 245 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:58,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 104 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 277 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2023-02-14 14:02:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-14 14:02:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2023-02-14 14:02:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 90 states have internal predecessors, (103), 0 states have call successors, (0), 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-14 14:02:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2023-02-14 14:02:58,584 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2023-02-14 14:02:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:58,584 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2023-02-14 14:02:58,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.206896551724138) internal successors, (93), 29 states have internal predecessors, (93), 0 states have call successors, (0), 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-14 14:02:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2023-02-14 14:02:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 14:02:58,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:58,585 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:58,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 14:02:58,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 14:02:58,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1932834185, now seen corresponding path program 1 times [2023-02-14 14:02:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:58,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902783159] [2023-02-14 14:02:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 14:02:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:02:58,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902783159] [2023-02-14 14:02:58,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902783159] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:02:58,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68254795] [2023-02-14 14:02:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:02:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:02:58,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:02:58,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 14:02:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:02:58,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:02:58,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:02:58,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 14:02:58,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 14:02:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 14:02:58,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:02:58,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68254795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:02:58,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 14:02:58,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-14 14:02:58,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033705634] [2023-02-14 14:02:58,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:02:58,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 14:02:58,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:02:58,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 14:02:58,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 14:02:58,981 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 14:02:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:02:59,003 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2023-02-14 14:02:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 14:02:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-14 14:02:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:02:59,004 INFO L225 Difference]: With dead ends: 92 [2023-02-14 14:02:59,004 INFO L226 Difference]: Without dead ends: 92 [2023-02-14 14:02:59,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 14:02:59,006 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:02:59,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:02:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-14 14:02:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-02-14 14:02:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 90 states have internal predecessors, (98), 0 states have call successors, (0), 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-14 14:02:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-02-14 14:02:59,008 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 44 [2023-02-14 14:02:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:02:59,010 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-02-14 14:02:59,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 14:02:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-02-14 14:02:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 14:02:59,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:02:59,014 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:02:59,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 14:02:59,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 14:02:59,220 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-14 14:02:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:02:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash -382975394, now seen corresponding path program 2 times [2023-02-14 14:02:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:02:59,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264792262] [2023-02-14 14:02:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:02:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:02:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:03:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 38 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 14:03:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:03:00,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264792262] [2023-02-14 14:03:00,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264792262] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 14:03:00,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870745644] [2023-02-14 14:03:00,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:03:00,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:03:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:03:00,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:03:00,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 14:03:00,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 14:03:00,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:03:00,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 14:03:00,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:03:00,608 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_763 Int) (|v_ULTIMATE.start_main_#t~malloc1#1.base_10| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_10| Int) (|v_ULTIMATE.start_main_#t~malloc2#1.base_10| Int) (v_ArrVal_757 Int) (v_ArrVal_756 Int) (|v_ULTIMATE.start_main_#t~malloc0#1.base_10| Int) (v_ArrVal_765 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc0#1.base_10| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_#t~malloc1#1.base_10| 1))) (and (= |c_#valid| (store (store (store (store (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc0#1.base_10| v_ArrVal_757) |v_ULTIMATE.start_main_#t~malloc1#1.base_10| v_ArrVal_756) |v_ULTIMATE.start_main_#t~malloc2#1.base_10| v_ArrVal_765) |v_ULTIMATE.start_main_#t~malloc3#1.base_10| v_ArrVal_763) |v_ULTIMATE.start_main_#t~malloc0#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc1#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc2#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc3#1.base_10| 0)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1#1.base_10|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc0#1.base_10|) 0) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc2#1.base_10|) 0) (= (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc2#1.base_10| 1) |v_ULTIMATE.start_main_#t~malloc3#1.base_10|) 0))))) is different from true [2023-02-14 14:03:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-02-14 14:03:00,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:03:00,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870745644] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:03:00,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 14:03:00,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [16] total 18 [2023-02-14 14:03:00,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769971446] [2023-02-14 14:03:00,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:03:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 14:03:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:03:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 14:03:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=204, Unknown=1, NotChecked=30, Total=306 [2023-02-14 14:03:00,610 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-14 14:03:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:03:00,635 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-02-14 14:03:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 14:03:00,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 52 [2023-02-14 14:03:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:03:00,636 INFO L225 Difference]: With dead ends: 90 [2023-02-14 14:03:00,636 INFO L226 Difference]: Without dead ends: 0 [2023-02-14 14:03:00,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=204, Unknown=1, NotChecked=30, Total=306 [2023-02-14 14:03:00,637 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:03:00,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2023-02-14 14:03:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-14 14:03:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-14 14:03:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:03:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-14 14:03:00,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2023-02-14 14:03:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:03:00,638 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 14:03:00,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-14 14:03:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-14 14:03:00,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-02-14 14:03:00,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-02-14 14:03:00,641 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-02-14 14:03:00,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-02-14 14:03:00,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-02-14 14:03:00,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-02-14 14:03:00,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-02-14 14:03:00,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-02-14 14:03:00,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2023-02-14 14:03:00,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 14:03:00,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:03:00,850 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:03:00,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 14:03:00,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:03:00 BoogieIcfgContainer [2023-02-14 14:03:00,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 14:03:00,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 14:03:00,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 14:03:00,855 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 14:03:00,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:02:27" (3/4) ... [2023-02-14 14:03:00,857 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-14 14:03:00,865 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-14 14:03:00,865 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-14 14:03:00,865 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-14 14:03:00,865 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-14 14:03:00,887 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 14:03:00,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 14:03:00,887 INFO L158 Benchmark]: Toolchain (without parser) took 33852.43ms. Allocated memory was 163.6MB in the beginning and 308.3MB in the end (delta: 144.7MB). Free memory was 131.5MB in the beginning and 220.8MB in the end (delta: -89.2MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,887 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:03:00,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.77ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 122.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.94ms. Allocated memory is still 163.6MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,888 INFO L158 Benchmark]: Boogie Preprocessor took 40.64ms. Allocated memory is still 163.6MB. Free memory was 120.2MB in the beginning and 118.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,888 INFO L158 Benchmark]: RCFGBuilder took 400.55ms. Allocated memory is still 163.6MB. Free memory was 118.9MB in the beginning and 103.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,888 INFO L158 Benchmark]: TraceAbstraction took 33195.41ms. Allocated memory was 163.6MB in the beginning and 308.3MB in the end (delta: 144.7MB). Free memory was 103.0MB in the beginning and 223.4MB in the end (delta: -120.4MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,889 INFO L158 Benchmark]: Witness Printer took 32.43ms. Allocated memory is still 308.3MB. Free memory was 223.4MB in the beginning and 220.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:03:00,890 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.77ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 122.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.94ms. Allocated memory is still 163.6MB. Free memory was 121.9MB in the beginning and 120.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.64ms. Allocated memory is still 163.6MB. Free memory was 120.2MB in the beginning and 118.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.55ms. Allocated memory is still 163.6MB. Free memory was 118.9MB in the beginning and 103.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33195.41ms. Allocated memory was 163.6MB in the beginning and 308.3MB in the end (delta: 144.7MB). Free memory was 103.0MB in the beginning and 223.4MB in the end (delta: -120.4MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 32.43ms. Allocated memory is still 308.3MB. Free memory was 223.4MB in the beginning and 220.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 93 mSolverCounterUnknown, 971 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 821 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 270 IncrementalHoareTripleChecker+Unchecked, 564 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1424 IncrementalHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 257 mSDtfsCounter, 1424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 317 SyntacticMatches, 8 SemanticMatches, 206 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=14, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 137 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 514 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 614 ConstructedInterpolants, 100 QuantifiedInterpolants, 10429 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1471 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 29 InterpolantComputations, 12 PerfectInterpolantSequences, 298/434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-02-14 14:03:00,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE