./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/relax-2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:51:37,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:51:37,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:51:37,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:51:37,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:51:37,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:51:37,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:51:37,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:51:37,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:51:37,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:51:37,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:51:37,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:51:37,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:51:37,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:51:37,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:51:37,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:51:37,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:51:37,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:51:37,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:51:37,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:51:37,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:51:37,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:51:37,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:51:37,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:51:37,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:51:37,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:51:37,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:51:37,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:51:37,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:51:37,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:51:37,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:51:37,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:51:37,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:51:37,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:51:37,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:51:37,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:51:37,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:51:37,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:51:37,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:51:37,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:51:37,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:51:37,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 04:51:37,956 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:51:37,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:51:37,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:51:37,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:51:37,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:51:37,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:51:37,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:51:37,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:51:37,961 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:51:37,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:51:37,962 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:51:37,962 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 04:51:37,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:51:37,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:51:37,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:51:37,963 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 04:51:37,963 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 04:51:37,963 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 04:51:37,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:51:37,964 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 04:51:37,964 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:51:37,964 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:51:37,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:51:37,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:51:37,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:51:37,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:51:37,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:51:37,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:51:37,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 04:51:37,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 04:51:37,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:51:37,967 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:51:37,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:51:37,967 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:51:37,967 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2023-02-18 04:51:38,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:51:38,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:51:38,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:51:38,276 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:51:38,277 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:51:38,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-18 04:51:39,542 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:51:39,763 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:51:39,766 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-18 04:51:39,779 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b6ca58a/bb1f2241ad624015b6031d96a2fc1f89/FLAGdba8cf350 [2023-02-18 04:51:39,794 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b6ca58a/bb1f2241ad624015b6031d96a2fc1f89 [2023-02-18 04:51:39,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:51:39,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:51:39,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:51:39,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:51:39,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:51:39,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:51:39" (1/1) ... [2023-02-18 04:51:39,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325307d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:39, skipping insertion in model container [2023-02-18 04:51:39,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:51:39" (1/1) ... [2023-02-18 04:51:39,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:51:39,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:51:40,026 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-18 04:51:40,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:51:40,187 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:51:40,199 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-18 04:51:40,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:51:40,271 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:51:40,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40 WrapperNode [2023-02-18 04:51:40,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:51:40,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:51:40,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:51:40,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:51:40,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,337 INFO L138 Inliner]: procedures = 120, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2023-02-18 04:51:40,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:51:40,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:51:40,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:51:40,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:51:40,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,381 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:51:40,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:51:40,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:51:40,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:51:40,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (1/1) ... [2023-02-18 04:51:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:51:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:51:40,422 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-18 04:51:40,424 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-18 04:51:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-18 04:51:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 04:51:40,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 04:51:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-18 04:51:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 04:51:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 04:51:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 04:51:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:51:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 04:51:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:51:40,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:51:40,541 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:51:40,543 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:51:40,831 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:51:40,837 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:51:40,837 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-18 04:51:40,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:51:40 BoogieIcfgContainer [2023-02-18 04:51:40,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:51:40,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:51:40,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:51:40,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:51:40,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:51:39" (1/3) ... [2023-02-18 04:51:40,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9ee80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:51:40, skipping insertion in model container [2023-02-18 04:51:40,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:51:40" (2/3) ... [2023-02-18 04:51:40,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9ee80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:51:40, skipping insertion in model container [2023-02-18 04:51:40,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:51:40" (3/3) ... [2023-02-18 04:51:40,862 INFO L112 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2023-02-18 04:51:40,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:51:40,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-02-18 04:51:40,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:51:40,946 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;@2b53b8d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:51:40,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-02-18 04:51:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 04:51:40,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:40,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:40,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1952693727, now seen corresponding path program 1 times [2023-02-18 04:51:40,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:40,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194143985] [2023-02-18 04:51:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:51:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:41,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194143985] [2023-02-18 04:51:41,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194143985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:51:41,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:51:41,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:51:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679588202] [2023-02-18 04:51:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:51:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 04:51:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 04:51:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 04:51:41,198 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 04:51:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:41,217 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2023-02-18 04:51:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 04:51:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-02-18 04:51:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:41,226 INFO L225 Difference]: With dead ends: 93 [2023-02-18 04:51:41,226 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 04:51:41,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 04:51:41,232 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:41,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:51:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 04:51:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-18 04:51:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.75) internal successors, (98), 82 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-02-18 04:51:41,264 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 15 [2023-02-18 04:51:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:41,264 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-02-18 04:51:41,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 04:51:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-02-18 04:51:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 04:51:41,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:41,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:41,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 04:51:41,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370847, now seen corresponding path program 1 times [2023-02-18 04:51:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:41,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79060222] [2023-02-18 04:51:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79060222] [2023-02-18 04:51:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79060222] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:51:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710198001] [2023-02-18 04:51:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:41,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:51:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:51:41,839 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-18 04:51:41,846 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-18 04:51:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:41,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 04:51:41,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:51:42,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 04:51:42,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2023-02-18 04:51:42,047 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 10 treesize of output 8 [2023-02-18 04:51:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:42,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:51:42,205 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 04:51:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:42,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710198001] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:51:42,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:51:42,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-18 04:51:42,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329694649] [2023-02-18 04:51:42,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:51:42,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 04:51:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 04:51:42,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:51:42,357 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:51:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:42,958 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2023-02-18 04:51:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:51:42,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-02-18 04:51:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:42,961 INFO L225 Difference]: With dead ends: 177 [2023-02-18 04:51:42,961 INFO L226 Difference]: Without dead ends: 177 [2023-02-18 04:51:42,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:51:42,962 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 493 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:42,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 490 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 04:51:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-18 04:51:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2023-02-18 04:51:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 88 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2023-02-18 04:51:42,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 15 [2023-02-18 04:51:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:42,979 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2023-02-18 04:51:42,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:51:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2023-02-18 04:51:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 04:51:42,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:42,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:42,989 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-18 04:51:43,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:51:43,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370848, now seen corresponding path program 1 times [2023-02-18 04:51:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:43,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132599884] [2023-02-18 04:51:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:51:43,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:43,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132599884] [2023-02-18 04:51:43,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132599884] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:51:43,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:51:43,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:51:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154241725] [2023-02-18 04:51:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:51:43,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 04:51:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 04:51:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 04:51:43,237 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:43,276 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2023-02-18 04:51:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 04:51:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-02-18 04:51:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:43,277 INFO L225 Difference]: With dead ends: 92 [2023-02-18 04:51:43,278 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 04:51:43,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 04:51:43,279 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:43,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 93 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:51:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 04:51:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-18 04:51:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 83 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-02-18 04:51:43,290 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 15 [2023-02-18 04:51:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:43,291 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-02-18 04:51:43,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-02-18 04:51:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 04:51:43,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:43,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:43,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 04:51:43,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167796, now seen corresponding path program 1 times [2023-02-18 04:51:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:43,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826918440] [2023-02-18 04:51:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:51:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826918440] [2023-02-18 04:51:43,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826918440] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:51:43,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:51:43,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:51:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538285619] [2023-02-18 04:51:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:51:43,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 04:51:43,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:43,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 04:51:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 04:51:43,328 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:43,364 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2023-02-18 04:51:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 04:51:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-18 04:51:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:43,366 INFO L225 Difference]: With dead ends: 87 [2023-02-18 04:51:43,367 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 04:51:43,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 04:51:43,368 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:43,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:51:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 04:51:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-18 04:51:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 78 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-02-18 04:51:43,373 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 17 [2023-02-18 04:51:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:43,373 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-02-18 04:51:43,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-02-18 04:51:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 04:51:43,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:43,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:43,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 04:51:43,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167795, now seen corresponding path program 1 times [2023-02-18 04:51:43,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:43,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487452016] [2023-02-18 04:51:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:43,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487452016] [2023-02-18 04:51:43,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487452016] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:51:43,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:51:43,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 04:51:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881081319] [2023-02-18 04:51:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:51:43,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 04:51:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 04:51:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:51:43,542 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:43,831 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2023-02-18 04:51:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:51:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-18 04:51:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:43,833 INFO L225 Difference]: With dead ends: 153 [2023-02-18 04:51:43,833 INFO L226 Difference]: Without dead ends: 153 [2023-02-18 04:51:43,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:51:43,834 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 327 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:43,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 280 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 04:51:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-18 04:51:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-18 04:51:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.546875) internal successors, (99), 80 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-02-18 04:51:43,839 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 17 [2023-02-18 04:51:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:43,839 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-02-18 04:51:43,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-02-18 04:51:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 04:51:43,840 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:43,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:43,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 04:51:43,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1093959206, now seen corresponding path program 1 times [2023-02-18 04:51:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517683785] [2023-02-18 04:51:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:51:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:43,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517683785] [2023-02-18 04:51:43,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517683785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:51:43,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:51:43,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 04:51:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895289708] [2023-02-18 04:51:43,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:51:43,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:51:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:51:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:51:43,908 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:43,963 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2023-02-18 04:51:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:51:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-18 04:51:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:43,964 INFO L225 Difference]: With dead ends: 88 [2023-02-18 04:51:43,964 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 04:51:43,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-18 04:51:43,966 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 133 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:43,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 108 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:51:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 04:51:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 04:51:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.53125) internal successors, (98), 79 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:51:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2023-02-18 04:51:43,970 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 20 [2023-02-18 04:51:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:43,971 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2023-02-18 04:51:43,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2023-02-18 04:51:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 04:51:43,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:43,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 04:51:43,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1093959205, now seen corresponding path program 1 times [2023-02-18 04:51:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257092282] [2023-02-18 04:51:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:51:44,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:44,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257092282] [2023-02-18 04:51:44,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257092282] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:51:44,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:51:44,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 04:51:44,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967299696] [2023-02-18 04:51:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:51:44,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 04:51:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 04:51:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:51:44,067 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:51:44,179 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2023-02-18 04:51:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 04:51:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-18 04:51:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:51:44,181 INFO L225 Difference]: With dead ends: 122 [2023-02-18 04:51:44,181 INFO L226 Difference]: Without dead ends: 122 [2023-02-18 04:51:44,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-18 04:51:44,182 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 83 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:51:44,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 357 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:51:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-18 04:51:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2023-02-18 04:51:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.513157894736842) internal successors, (115), 91 states have internal predecessors, (115), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:51:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2023-02-18 04:51:44,186 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 20 [2023-02-18 04:51:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:51:44,186 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2023-02-18 04:51:44,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:51:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2023-02-18 04:51:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 04:51:44,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:51:44,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:51:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 04:51:44,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:51:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:51:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash 495604816, now seen corresponding path program 1 times [2023-02-18 04:51:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:51:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97188084] [2023-02-18 04:51:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:51:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:51:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:51:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:51:44,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97188084] [2023-02-18 04:51:44,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97188084] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:51:44,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333891559] [2023-02-18 04:51:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:51:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:51:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:51:44,397 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-18 04:51:44,427 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-18 04:51:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:51:44,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 04:51:44,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:51:44,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:51:44,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 33 [2023-02-18 04:51:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:45,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:51:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:51:45,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333891559] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:51:45,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:51:45,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-02-18 04:51:45,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120987534] [2023-02-18 04:51:45,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:51:45,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 04:51:45,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:51:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 04:51:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-02-18 04:51:45,458 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 04:51:47,683 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 [0] [2023-02-18 04:51:49,931 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 [0] [2023-02-18 04:51:53,727 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 [0] [2023-02-18 04:51:55,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:51:58,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:00,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:02,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:04,465 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 [0] [2023-02-18 04:52:08,328 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 [0] [2023-02-18 04:52:11,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:13,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:14,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:15,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:17,918 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 [0] [2023-02-18 04:52:20,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:21,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:22,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:24,559 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 [0] [2023-02-18 04:52:25,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:27,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 04:52:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:29,128 INFO L93 Difference]: Finished difference Result 165 states and 216 transitions. [2023-02-18 04:52:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 04:52:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-02-18 04:52:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:29,129 INFO L225 Difference]: With dead ends: 165 [2023-02-18 04:52:29,129 INFO L226 Difference]: Without dead ends: 165 [2023-02-18 04:52:29,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2023-02-18 04:52:29,130 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 704 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 57 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:29,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 413 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 432 Invalid, 14 Unknown, 0 Unchecked, 43.3s Time] [2023-02-18 04:52:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-18 04:52:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 99. [2023-02-18 04:52:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 89 states have internal predecessors, (113), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:52:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2023-02-18 04:52:29,138 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 21 [2023-02-18 04:52:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:29,138 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2023-02-18 04:52:29,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 04:52:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2023-02-18 04:52:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 04:52:29,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:29,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:29,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:29,347 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,SelfDestructingSolverStorable7 [2023-02-18 04:52:29,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:52:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 45614243, now seen corresponding path program 1 times [2023-02-18 04:52:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:29,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824770047] [2023-02-18 04:52:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:52:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:29,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824770047] [2023-02-18 04:52:29,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824770047] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:29,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:29,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:52:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917899222] [2023-02-18 04:52:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:29,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:52:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:52:29,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:52:29,401 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:29,458 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-02-18 04:52:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:52:29,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-18 04:52:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:29,461 INFO L225 Difference]: With dead ends: 144 [2023-02-18 04:52:29,461 INFO L226 Difference]: Without dead ends: 144 [2023-02-18 04:52:29,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-18 04:52:29,462 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 68 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:29,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 267 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-18 04:52:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2023-02-18 04:52:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.5) internal successors, (150), 114 states have internal predecessors, (150), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:52:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 168 transitions. [2023-02-18 04:52:29,467 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 168 transitions. Word has length 23 [2023-02-18 04:52:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:29,468 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 168 transitions. [2023-02-18 04:52:29,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 168 transitions. [2023-02-18 04:52:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 04:52:29,469 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:29,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:29,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 04:52:29,470 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:52:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1356766572, now seen corresponding path program 1 times [2023-02-18 04:52:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:29,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868222956] [2023-02-18 04:52:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:52:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868222956] [2023-02-18 04:52:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868222956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:29,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:29,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:52:29,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707542006] [2023-02-18 04:52:29,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:29,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:52:29,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:29,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:52:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:52:29,514 INFO L87 Difference]: Start difference. First operand 125 states and 168 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:29,528 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2023-02-18 04:52:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:52:29,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-18 04:52:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:29,530 INFO L225 Difference]: With dead ends: 149 [2023-02-18 04:52:29,530 INFO L226 Difference]: Without dead ends: 149 [2023-02-18 04:52:29,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-18 04:52:29,531 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 17 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:29,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 290 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:52:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-18 04:52:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2023-02-18 04:52:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.471698113207547) internal successors, (156), 120 states have internal predecessors, (156), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:52:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2023-02-18 04:52:29,535 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 24 [2023-02-18 04:52:29,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:29,535 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2023-02-18 04:52:29,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2023-02-18 04:52:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 04:52:29,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:29,537 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:29,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 04:52:29,537 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:52:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 295352039, now seen corresponding path program 1 times [2023-02-18 04:52:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:29,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165950246] [2023-02-18 04:52:29,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:52:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:52:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:29,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165950246] [2023-02-18 04:52:29,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165950246] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:29,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131284035] [2023-02-18 04:52:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:29,782 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-18 04:52:29,784 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-18 04:52:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:29,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 04:52:29,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:29,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 04:52:29,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15 [2023-02-18 04:52:29,903 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 10 treesize of output 8 [2023-02-18 04:52:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:52:30,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:30,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 04:52:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:52:30,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131284035] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:30,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:30,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2023-02-18 04:52:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878326353] [2023-02-18 04:52:30,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:30,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 04:52:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 04:52:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2023-02-18 04:52:30,423 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:31,506 INFO L93 Difference]: Finished difference Result 299 states and 394 transitions. [2023-02-18 04:52:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:52:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-02-18 04:52:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:31,508 INFO L225 Difference]: With dead ends: 299 [2023-02-18 04:52:31,508 INFO L226 Difference]: Without dead ends: 299 [2023-02-18 04:52:31,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-02-18 04:52:31,509 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 1031 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:31,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 906 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 04:52:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-18 04:52:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 125. [2023-02-18 04:52:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 114 states have internal predecessors, (149), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:52:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2023-02-18 04:52:31,514 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 23 [2023-02-18 04:52:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:31,515 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2023-02-18 04:52:31,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2023-02-18 04:52:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 04:52:31,515 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:31,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:31,526 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-18 04:52:31,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:31,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:52:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1536082760, now seen corresponding path program 1 times [2023-02-18 04:52:31,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:31,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558773826] [2023-02-18 04:52:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:52:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558773826] [2023-02-18 04:52:31,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558773826] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931035885] [2023-02-18 04:52:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:31,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:31,977 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-18 04:52:31,998 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-18 04:52:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:52:32,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:52:32,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:52:32,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931035885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:32,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:52:32,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2023-02-18 04:52:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500135557] [2023-02-18 04:52:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:32,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 04:52:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 04:52:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:32,099 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:32,222 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2023-02-18 04:52:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 04:52:32,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-18 04:52:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:32,224 INFO L225 Difference]: With dead ends: 127 [2023-02-18 04:52:32,224 INFO L226 Difference]: Without dead ends: 127 [2023-02-18 04:52:32,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 04:52:32,224 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 56 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:32,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 419 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-18 04:52:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2023-02-18 04:52:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 103 states have internal predecessors, (128), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:52:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2023-02-18 04:52:32,231 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 24 [2023-02-18 04:52:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:32,231 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2023-02-18 04:52:32,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2023-02-18 04:52:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 04:52:32,235 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:32,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:32,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:32,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:32,440 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:52:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash 938576587, now seen corresponding path program 1 times [2023-02-18 04:52:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:32,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141161849] [2023-02-18 04:52:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:52:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:32,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141161849] [2023-02-18 04:52:32,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141161849] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:32,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:32,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 04:52:32,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482722698] [2023-02-18 04:52:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:32,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 04:52:32,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 04:52:32,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:52:32,546 INFO L87 Difference]: Start difference. First operand 114 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:32,634 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2023-02-18 04:52:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:52:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-18 04:52:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:32,635 INFO L225 Difference]: With dead ends: 127 [2023-02-18 04:52:32,635 INFO L226 Difference]: Without dead ends: 127 [2023-02-18 04:52:32,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:52:32,636 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:32,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 433 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-18 04:52:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2023-02-18 04:52:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 106 states have internal predecessors, (131), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:52:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2023-02-18 04:52:32,639 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 26 [2023-02-18 04:52:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:32,640 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2023-02-18 04:52:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:52:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2023-02-18 04:52:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 04:52:32,640 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:32,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:32,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 04:52:32,641 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:52:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1223684762, now seen corresponding path program 1 times [2023-02-18 04:52:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:32,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793918490] [2023-02-18 04:52:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:52:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:32,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793918490] [2023-02-18 04:52:32,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793918490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117699812] [2023-02-18 04:52:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:32,785 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-18 04:52:32,788 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-18 04:52:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 04:52:32,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:33,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:08,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117699812] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:08,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:08,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2023-02-18 04:53:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401545603] [2023-02-18 04:53:08,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:08,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 04:53:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 04:53:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=257, Unknown=12, NotChecked=0, Total=342 [2023-02-18 04:53:08,700 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:26,965 INFO L93 Difference]: Finished difference Result 405 states and 496 transitions. [2023-02-18 04:53:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-18 04:53:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-02-18 04:53:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:26,967 INFO L225 Difference]: With dead ends: 405 [2023-02-18 04:53:26,968 INFO L226 Difference]: Without dead ends: 405 [2023-02-18 04:53:26,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=383, Invalid=1159, Unknown=18, NotChecked=0, Total=1560 [2023-02-18 04:53:26,969 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 1349 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:26,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 1154 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-18 04:53:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-18 04:53:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 174. [2023-02-18 04:53:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 160 states have internal predecessors, (209), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2023-02-18 04:53:26,977 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 27 [2023-02-18 04:53:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:26,978 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2023-02-18 04:53:26,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2023-02-18 04:53:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:53:26,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:26,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:26,989 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-18 04:53:27,185 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,SelfDestructingSolverStorable13 [2023-02-18 04:53:27,185 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2020711139, now seen corresponding path program 1 times [2023-02-18 04:53:27,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098931439] [2023-02-18 04:53:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:53:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098931439] [2023-02-18 04:53:27,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098931439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:27,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:27,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:53:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747502545] [2023-02-18 04:53:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:27,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:53:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:27,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:53:27,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:53:27,250 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:27,264 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2023-02-18 04:53:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:53:27,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 04:53:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:27,266 INFO L225 Difference]: With dead ends: 174 [2023-02-18 04:53:27,266 INFO L226 Difference]: Without dead ends: 174 [2023-02-18 04:53:27,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-18 04:53:27,267 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:27,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-18 04:53:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2023-02-18 04:53:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.3943661971830985) internal successors, (198), 155 states have internal predecessors, (198), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 220 transitions. [2023-02-18 04:53:27,272 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 220 transitions. Word has length 29 [2023-02-18 04:53:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:27,273 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 220 transitions. [2023-02-18 04:53:27,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2023-02-18 04:53:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 04:53:27,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:27,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:27,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 04:53:27,274 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2065321045, now seen corresponding path program 1 times [2023-02-18 04:53:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:27,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194575770] [2023-02-18 04:53:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:27,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:53:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:27,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194575770] [2023-02-18 04:53:27,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194575770] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:27,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954778112] [2023-02-18 04:53:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:27,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:27,369 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-18 04:53:27,372 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-18 04:53:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 04:53:27,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:27,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:27,497 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 27 treesize of output 23 [2023-02-18 04:53:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:27,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954778112] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:27,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:27,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-02-18 04:53:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560273539] [2023-02-18 04:53:27,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:27,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 04:53:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 04:53:27,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:53:27,518 INFO L87 Difference]: Start difference. First operand 169 states and 220 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:27,712 INFO L93 Difference]: Finished difference Result 273 states and 359 transitions. [2023-02-18 04:53:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:53:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-18 04:53:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:27,713 INFO L225 Difference]: With dead ends: 273 [2023-02-18 04:53:27,714 INFO L226 Difference]: Without dead ends: 273 [2023-02-18 04:53:27,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-02-18 04:53:27,714 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 540 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:27,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 400 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-18 04:53:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 175. [2023-02-18 04:53:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 161 states have internal predecessors, (207), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2023-02-18 04:53:27,720 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 229 transitions. Word has length 28 [2023-02-18 04:53:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:27,721 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 229 transitions. [2023-02-18 04:53:27,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 229 transitions. [2023-02-18 04:53:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 04:53:27,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:27,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:27,736 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-18 04:53:27,929 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-18 04:53:27,929 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash 143992616, now seen corresponding path program 1 times [2023-02-18 04:53:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:27,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961243019] [2023-02-18 04:53:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:53:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:28,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:28,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961243019] [2023-02-18 04:53:28,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961243019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:28,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687142789] [2023-02-18 04:53:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:28,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:28,153 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-18 04:53:28,156 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-18 04:53:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 04:53:28,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:28,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:28,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687142789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:28,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:53:28,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2023-02-18 04:53:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969026796] [2023-02-18 04:53:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:28,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 04:53:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 04:53:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:53:28,289 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:28,395 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2023-02-18 04:53:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 04:53:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-18 04:53:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:28,396 INFO L225 Difference]: With dead ends: 188 [2023-02-18 04:53:28,396 INFO L226 Difference]: Without dead ends: 188 [2023-02-18 04:53:28,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 04:53:28,397 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 125 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:28,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 286 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-18 04:53:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 173. [2023-02-18 04:53:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 145 states have (on average 1.3517241379310345) internal successors, (196), 158 states have internal predecessors, (196), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 218 transitions. [2023-02-18 04:53:28,402 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 218 transitions. Word has length 30 [2023-02-18 04:53:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:28,402 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 218 transitions. [2023-02-18 04:53:28,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 218 transitions. [2023-02-18 04:53:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:53:28,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:28,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:28,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-18 04:53:28,616 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-18 04:53:28,616 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash -399557048, now seen corresponding path program 1 times [2023-02-18 04:53:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168888028] [2023-02-18 04:53:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:53:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:28,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168888028] [2023-02-18 04:53:28,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168888028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:28,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:28,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 04:53:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340860881] [2023-02-18 04:53:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:28,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:53:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:53:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:53:28,664 INFO L87 Difference]: Start difference. First operand 173 states and 218 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:28,720 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2023-02-18 04:53:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:53:28,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 04:53:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:28,722 INFO L225 Difference]: With dead ends: 172 [2023-02-18 04:53:28,723 INFO L226 Difference]: Without dead ends: 172 [2023-02-18 04:53:28,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-18 04:53:28,724 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:28,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 112 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-18 04:53:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2023-02-18 04:53:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 157 states have internal predecessors, (194), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2023-02-18 04:53:28,731 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 29 [2023-02-18 04:53:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:28,732 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2023-02-18 04:53:28,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2023-02-18 04:53:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:53:28,733 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:28,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:28,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-18 04:53:28,733 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:28,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash -399557047, now seen corresponding path program 1 times [2023-02-18 04:53:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:28,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342876177] [2023-02-18 04:53:28,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 04:53:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:28,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342876177] [2023-02-18 04:53:28,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342876177] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:28,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498662296] [2023-02-18 04:53:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:28,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:28,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:28,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 04:53:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 04:53:28,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:28,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:28,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 04:53:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:29,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:29,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498662296] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:29,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2023-02-18 04:53:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427742886] [2023-02-18 04:53:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:29,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 04:53:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 04:53:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-02-18 04:53:29,057 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:29,270 INFO L93 Difference]: Finished difference Result 248 states and 311 transitions. [2023-02-18 04:53:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:53:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 04:53:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:29,272 INFO L225 Difference]: With dead ends: 248 [2023-02-18 04:53:29,272 INFO L226 Difference]: Without dead ends: 248 [2023-02-18 04:53:29,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-02-18 04:53:29,273 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 322 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:29,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 275 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-18 04:53:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 174. [2023-02-18 04:53:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 159 states have internal predecessors, (196), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 218 transitions. [2023-02-18 04:53:29,279 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 218 transitions. Word has length 29 [2023-02-18 04:53:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:29,279 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 218 transitions. [2023-02-18 04:53:29,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 218 transitions. [2023-02-18 04:53:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 04:53:29,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:29,280 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:29,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:29,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:29,486 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash -85984087, now seen corresponding path program 2 times [2023-02-18 04:53:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907191495] [2023-02-18 04:53:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 04:53:29,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 04:53:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 04:53:29,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 04:53:29,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 04:53:29,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-02-18 04:53:29,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-02-18 04:53:29,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-02-18 04:53:29,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-02-18 04:53:29,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-02-18 04:53:29,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-02-18 04:53:29,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-02-18 04:53:29,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-02-18 04:53:29,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-02-18 04:53:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-02-18 04:53:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-02-18 04:53:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-02-18 04:53:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-02-18 04:53:29,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-02-18 04:53:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-02-18 04:53:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-02-18 04:53:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-02-18 04:53:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2023-02-18 04:53:29,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2023-02-18 04:53:29,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2023-02-18 04:53:29,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-02-18 04:53:29,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-02-18 04:53:29,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-02-18 04:53:29,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-02-18 04:53:29,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-02-18 04:53:29,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2023-02-18 04:53:29,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-18 04:53:29,541 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:29,544 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:53:29,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:53:29 BoogieIcfgContainer [2023-02-18 04:53:29,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:53:29,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:53:29,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:53:29,566 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:53:29,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:51:40" (3/4) ... [2023-02-18 04:53:29,569 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 04:53:29,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:53:29,569 INFO L158 Benchmark]: Toolchain (without parser) took 109771.66ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 72.4MB in the beginning and 153.6MB in the end (delta: -81.2MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2023-02-18 04:53:29,569 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:53:29,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.29ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 53.9MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-18 04:53:29,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 109.1MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:53:29,570 INFO L158 Benchmark]: Boogie Preprocessor took 50.39ms. Allocated memory is still 109.1MB. Free memory was 51.5MB in the beginning and 50.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:53:29,571 INFO L158 Benchmark]: RCFGBuilder took 449.83ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 49.7MB in the beginning and 115.4MB in the end (delta: -65.7MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2023-02-18 04:53:29,571 INFO L158 Benchmark]: TraceAbstraction took 108724.45ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 114.9MB in the beginning and 153.6MB in the end (delta: -38.7MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2023-02-18 04:53:29,571 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 268.4MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:53:29,572 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.21ms. Allocated memory is still 109.1MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.29ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 53.9MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 109.1MB. Free memory was 53.9MB in the beginning and 51.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.39ms. Allocated memory is still 109.1MB. Free memory was 51.5MB in the beginning and 50.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.83ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 49.7MB in the beginning and 115.4MB in the end (delta: -65.7MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 108724.45ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 114.9MB in the beginning and 153.6MB in the end (delta: -38.7MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 268.4MB. Free memory is still 153.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 1128]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1128. Possible FailurePath: [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1132] CALL assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1132] RET assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [pat_len=-4294967294] [L1133] CALL assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1133] RET assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [a_len=0, pat_len=-4294967294] [L1134] int *pat=malloc(sizeof(int)*pat_len); [L1135] int *a=malloc(sizeof(int)*a_len); [L1139] int j = 0; VAL [a={-2:0}, a_len=0, j=0, pat={-1:0}, pat_len=-4294967294] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, a={-2:0}, a_len=0, j=0, pat={-1:0}, pat_len=-4294967294] [L1139] j++ VAL [a={-2:0}, a_len=0, j=1, pat={-1:0}, pat_len=-4294967294] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={-2:0}, a_len=0, j=1, pat={-1:0}, pat_len=-4294967294] [L1139] j++ VAL [a={-2:0}, a_len=0, j=2, pat={-1:0}, pat_len=-4294967294] [L1139] COND FALSE !(j < pat_len) VAL [a={-2:0}, a_len=0, j=2, pat={-1:0}, pat_len=-4294967294] [L1142] int j = 0; VAL [a={-2:0}, a_len=0, j=2, j=0, pat={-1:0}, pat_len=-4294967294] [L1142] COND FALSE !(j < a_len) VAL [a={-2:0}, a_len=0, j=0, j=2, pat={-1:0}, pat_len=-4294967294] [L1147] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L1106] COND TRUE pat_length>a_length+1 [L1107] return 0; VAL [\old(a_length)=0, \old(pat_length)=2, \result=0, a={-2:0}, a={-2:0}, a_length=0, pat={-1:0}, pat={-1:0}, pat_length=2] [L1147] RET is_relaxed_prefix(pat, pat_len, a, a_len) [L1147] COND FALSE !(is_relaxed_prefix(pat, pat_len, a, a_len)) [L1163] COND FALSE !(pat_len<=a_len+1) VAL [a={-2:0}, a_len=0, j=2, j=0, pat={-1:0}, pat_len=-4294967294] [L1176] return 0; VAL [\result=0, a={-2:0}, a_len=0, j=0, j=2, pat={-1:0}, pat_len=-4294967294] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 108.6s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 65.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 5646 SdHoareTripleChecker+Valid, 47.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5608 mSDsluCounter, 6746 SdHoareTripleChecker+Invalid, 46.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4981 mSDsCounter, 538 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3575 IncrementalHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 538 mSolverCounterUnsat, 1765 mSDtfsCounter, 3575 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 352 SyntacticMatches, 29 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 48.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=16, InterpolantAutomatonStates: 142, 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, 19 MinimizatonAttempts, 887 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 660 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 739 ConstructedInterpolants, 12 QuantifiedInterpolants, 26977 SizeOfPredicates, 52 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 125/183 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-18 04:53:29,737 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:53:31,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:53:31,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:53:31,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:53:31,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:53:31,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:53:31,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:53:31,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:53:31,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:53:31,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:53:31,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:53:31,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:53:31,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:53:31,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:53:31,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:53:31,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:53:31,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:53:31,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:53:31,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:53:31,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:53:31,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:53:31,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:53:31,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:53:31,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:53:31,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:53:31,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:53:31,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:53:31,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:53:31,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:53:31,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:53:31,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:53:31,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:53:31,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:53:31,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:53:31,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:53:31,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:53:31,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:53:31,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:53:31,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:53:31,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:53:31,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:53:31,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-18 04:53:31,763 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:53:31,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:53:31,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:53:31,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:53:31,766 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:53:31,766 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:53:31,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:53:31,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:53:31,767 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:53:31,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:53:31,768 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:53:31,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 04:53:31,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:53:31,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:53:31,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:53:31,769 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 04:53:31,769 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 04:53:31,770 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 04:53:31,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:53:31,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 04:53:31,770 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 04:53:31,770 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 04:53:31,771 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:53:31,771 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:53:31,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:53:31,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:53:31,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:53:31,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:53:31,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:53:31,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:53:31,773 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 04:53:31,773 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 04:53:31,773 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:53:31,773 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:53:31,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:53:31,774 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 04:53:31,774 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:53:31,774 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2023-02-18 04:53:32,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:53:32,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:53:32,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:53:32,113 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:53:32,113 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:53:32,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-18 04:53:33,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:53:33,540 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:53:33,541 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2023-02-18 04:53:33,561 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25134af8/874fe9b2cafe4bd8b0bee7b85cd02c2a/FLAG4922f6f9b [2023-02-18 04:53:33,583 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25134af8/874fe9b2cafe4bd8b0bee7b85cd02c2a [2023-02-18 04:53:33,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:53:33,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:53:33,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:53:33,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:53:33,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:53:33,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:53:33" (1/1) ... [2023-02-18 04:53:33,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282302aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:33, skipping insertion in model container [2023-02-18 04:53:33,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:53:33" (1/1) ... [2023-02-18 04:53:33,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:53:33,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:53:33,792 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-18 04:53:33,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:53:33,969 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:53:33,983 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i[982,995] [2023-02-18 04:53:34,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:53:34,046 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:53:34,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34 WrapperNode [2023-02-18 04:53:34,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:53:34,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:53:34,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:53:34,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:53:34,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,112 INFO L138 Inliner]: procedures = 123, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 136 [2023-02-18 04:53:34,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:53:34,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:53:34,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:53:34,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:53:34,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:53:34,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:53:34,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:53:34,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:53:34,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (1/1) ... [2023-02-18 04:53:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:53:34,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:34,202 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-18 04:53:34,211 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-18 04:53:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-18 04:53:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 04:53:34,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 04:53:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 04:53:34,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 04:53:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 04:53:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:53:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-18 04:53:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 04:53:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:53:34,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:53:34,386 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:53:34,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:53:34,790 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:53:34,798 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:53:34,798 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-18 04:53:34,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:53:34 BoogieIcfgContainer [2023-02-18 04:53:34,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:53:34,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:53:34,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:53:34,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:53:34,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:53:33" (1/3) ... [2023-02-18 04:53:34,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e638cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:53:34, skipping insertion in model container [2023-02-18 04:53:34,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:53:34" (2/3) ... [2023-02-18 04:53:34,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e638cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:53:34, skipping insertion in model container [2023-02-18 04:53:34,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:53:34" (3/3) ... [2023-02-18 04:53:34,832 INFO L112 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2023-02-18 04:53:34,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:53:34,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-02-18 04:53:34,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:53:34,910 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;@669a2101, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:53:34,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-02-18 04:53:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 04:53:34,921 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:34,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:34,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1952693727, now seen corresponding path program 1 times [2023-02-18 04:53:34,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:34,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495903245] [2023-02-18 04:53:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:34,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:34,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:34,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:34,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 04:53:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:35,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 04:53:35,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 04:53:35,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:35,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:35,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495903245] [2023-02-18 04:53:35,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495903245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:35,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:35,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:53:35,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419552660] [2023-02-18 04:53:35,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:35,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 04:53:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 04:53:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 04:53:35,125 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 84 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 04:53:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:35,152 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2023-02-18 04:53:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 04:53:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-02-18 04:53:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:35,164 INFO L225 Difference]: With dead ends: 93 [2023-02-18 04:53:35,165 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 04:53:35,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 04:53:35,170 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:35,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 04:53:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-18 04:53:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.75) internal successors, (98), 82 states have internal predecessors, (98), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-02-18 04:53:35,219 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 15 [2023-02-18 04:53:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:35,220 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-02-18 04:53:35,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 04:53:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-02-18 04:53:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 04:53:35,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:35,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:35,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:35,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:35,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:35,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370847, now seen corresponding path program 1 times [2023-02-18 04:53:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:35,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143747656] [2023-02-18 04:53:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:35,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:35,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:35,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 04:53:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:35,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 04:53:35,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:35,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 04:53:35,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2023-02-18 04:53:35,677 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 10 treesize of output 8 [2023-02-18 04:53:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:35,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:35,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 04:53:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:35,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:35,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143747656] [2023-02-18 04:53:35,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143747656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:35,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:35,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 04:53:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867936438] [2023-02-18 04:53:35,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:35,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:53:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:35,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:53:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:53:35,951 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:37,200 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2023-02-18 04:53:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:53:37,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-02-18 04:53:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:37,203 INFO L225 Difference]: With dead ends: 177 [2023-02-18 04:53:37,203 INFO L226 Difference]: Without dead ends: 177 [2023-02-18 04:53:37,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-02-18 04:53:37,205 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 362 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:37,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 331 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 04:53:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-18 04:53:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2023-02-18 04:53:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 88 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2023-02-18 04:53:37,217 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 15 [2023-02-18 04:53:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:37,217 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2023-02-18 04:53:37,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2023-02-18 04:53:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 04:53:37,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:37,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:37,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:37,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:37,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1194370848, now seen corresponding path program 1 times [2023-02-18 04:53:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21274599] [2023-02-18 04:53:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:37,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:37,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:37,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 04:53:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:37,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 04:53:37,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:37,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:37,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 04:53:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:37,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:37,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:37,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21274599] [2023-02-18 04:53:37,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21274599] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:37,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:37,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:53:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171094956] [2023-02-18 04:53:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:37,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 04:53:37,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:37,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 04:53:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 04:53:37,539 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:37,656 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2023-02-18 04:53:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 04:53:37,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-02-18 04:53:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:37,658 INFO L225 Difference]: With dead ends: 92 [2023-02-18 04:53:37,658 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 04:53:37,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-18 04:53:37,659 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:37,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 93 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 04:53:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-18 04:53:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 83 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-02-18 04:53:37,666 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 15 [2023-02-18 04:53:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:37,666 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-02-18 04:53:37,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-02-18 04:53:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 04:53:37,667 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:37,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:37,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:37,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167796, now seen corresponding path program 1 times [2023-02-18 04:53:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:37,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999518569] [2023-02-18 04:53:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:37,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:37,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:37,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 04:53:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:37,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 04:53:37,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:37,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:37,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 04:53:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:37,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:37,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:37,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999518569] [2023-02-18 04:53:37,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999518569] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:37,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:37,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 04:53:37,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944957058] [2023-02-18 04:53:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:37,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 04:53:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:37,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 04:53:37,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 04:53:37,957 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:38,058 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2023-02-18 04:53:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 04:53:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-18 04:53:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:38,060 INFO L225 Difference]: With dead ends: 87 [2023-02-18 04:53:38,060 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 04:53:38,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-18 04:53:38,061 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:38,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 93 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 04:53:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-18 04:53:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 78 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-02-18 04:53:38,067 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 17 [2023-02-18 04:53:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:38,067 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-02-18 04:53:38,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-02-18 04:53:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 04:53:38,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:38,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:38,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:38,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:38,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1034167795, now seen corresponding path program 1 times [2023-02-18 04:53:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:38,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501683575] [2023-02-18 04:53:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:38,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:38,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:38,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:38,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 04:53:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:38,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 04:53:38,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:38,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:38,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-18 04:53:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:38,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:38,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:38,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501683575] [2023-02-18 04:53:38,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501683575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:38,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 04:53:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395481629] [2023-02-18 04:53:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 04:53:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 04:53:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:53:38,415 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:38,971 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2023-02-18 04:53:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:53:38,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-18 04:53:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:38,973 INFO L225 Difference]: With dead ends: 153 [2023-02-18 04:53:38,973 INFO L226 Difference]: Without dead ends: 153 [2023-02-18 04:53:38,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:53:38,974 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 251 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:38,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 288 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 04:53:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-18 04:53:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-18 04:53:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.546875) internal successors, (99), 80 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-02-18 04:53:38,980 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 17 [2023-02-18 04:53:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:38,981 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-02-18 04:53:38,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-02-18 04:53:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 04:53:38,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:38,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:38,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:39,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:39,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1093959206, now seen corresponding path program 1 times [2023-02-18 04:53:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234880130] [2023-02-18 04:53:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:39,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:39,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:39,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 04:53:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:39,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:53:39,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:39,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:39,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:39,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234880130] [2023-02-18 04:53:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234880130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:39,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 04:53:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068798344] [2023-02-18 04:53:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:39,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 04:53:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 04:53:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:53:39,308 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:39,497 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2023-02-18 04:53:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:53:39,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2023-02-18 04:53:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:39,499 INFO L225 Difference]: With dead ends: 109 [2023-02-18 04:53:39,499 INFO L226 Difference]: Without dead ends: 109 [2023-02-18 04:53:39,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:53:39,500 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 143 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:39,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 442 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-18 04:53:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2023-02-18 04:53:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 92 states have internal predecessors, (116), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:53:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2023-02-18 04:53:39,514 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 20 [2023-02-18 04:53:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:39,514 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2023-02-18 04:53:39,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2023-02-18 04:53:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 04:53:39,515 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:39,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:39,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-18 04:53:39,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:39,724 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash 495604816, now seen corresponding path program 1 times [2023-02-18 04:53:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:39,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938135521] [2023-02-18 04:53:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:39,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:39,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 04:53:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:39,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 04:53:39,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:39,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:39,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-18 04:53:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:39,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:40,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:40,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938135521] [2023-02-18 04:53:40,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938135521] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:40,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:40,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-18 04:53:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150061041] [2023-02-18 04:53:40,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:40,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 04:53:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 04:53:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:53:40,278 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 04:53:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:41,175 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2023-02-18 04:53:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 04:53:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-02-18 04:53:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:41,177 INFO L225 Difference]: With dead ends: 167 [2023-02-18 04:53:41,177 INFO L226 Difference]: Without dead ends: 167 [2023-02-18 04:53:41,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:53:41,178 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 418 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:41,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 396 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 04:53:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-18 04:53:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 100. [2023-02-18 04:53:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.52) internal successors, (114), 90 states have internal predecessors, (114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:53:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2023-02-18 04:53:41,183 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 21 [2023-02-18 04:53:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:41,184 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2023-02-18 04:53:41,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 04:53:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2023-02-18 04:53:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 04:53:41,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:41,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:41,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:41,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:41,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 45614243, now seen corresponding path program 1 times [2023-02-18 04:53:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:41,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027561465] [2023-02-18 04:53:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:41,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:41,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:41,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:41,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 04:53:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 04:53:41,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:41,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:41,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:41,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027561465] [2023-02-18 04:53:41,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027561465] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:41,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:41,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 04:53:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863071939] [2023-02-18 04:53:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:41,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 04:53:41,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 04:53:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-18 04:53:41,503 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 04:53:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:41,708 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2023-02-18 04:53:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:53:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-02-18 04:53:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:41,710 INFO L225 Difference]: With dead ends: 137 [2023-02-18 04:53:41,710 INFO L226 Difference]: Without dead ends: 137 [2023-02-18 04:53:41,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:53:41,711 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 217 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:41,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 448 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-18 04:53:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2023-02-18 04:53:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 106 states have internal predecessors, (132), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2023-02-18 04:53:41,717 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 23 [2023-02-18 04:53:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:41,717 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2023-02-18 04:53:41,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 04:53:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2023-02-18 04:53:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 04:53:41,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:41,719 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:41,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-02-18 04:53:41,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:41,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash 295352039, now seen corresponding path program 1 times [2023-02-18 04:53:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051514722] [2023-02-18 04:53:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:41,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:41,929 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:41,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 04:53:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 04:53:41,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 04:53:42,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2023-02-18 04:53:42,028 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 10 treesize of output 8 [2023-02-18 04:53:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:42,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:42,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 04:53:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:42,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051514722] [2023-02-18 04:53:42,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051514722] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:42,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:42,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-18 04:53:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167819669] [2023-02-18 04:53:42,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:42,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 04:53:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 04:53:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:53:42,566 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:45,713 INFO L93 Difference]: Finished difference Result 435 states and 580 transitions. [2023-02-18 04:53:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 04:53:45,714 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-02-18 04:53:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:45,716 INFO L225 Difference]: With dead ends: 435 [2023-02-18 04:53:45,716 INFO L226 Difference]: Without dead ends: 435 [2023-02-18 04:53:45,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-02-18 04:53:45,717 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1676 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:45,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 808 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-02-18 04:53:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-02-18 04:53:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 133. [2023-02-18 04:53:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 122 states have internal predecessors, (152), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 170 transitions. [2023-02-18 04:53:45,727 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 170 transitions. Word has length 23 [2023-02-18 04:53:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:45,727 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 170 transitions. [2023-02-18 04:53:45,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2023-02-18 04:53:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 04:53:45,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:45,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:45,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:45,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 938576587, now seen corresponding path program 1 times [2023-02-18 04:53:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:45,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358651214] [2023-02-18 04:53:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:45,940 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:45,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 04:53:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:46,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:53:46,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:46,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:46,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:46,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358651214] [2023-02-18 04:53:46,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358651214] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:46,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:53:46,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2023-02-18 04:53:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139381681] [2023-02-18 04:53:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:46,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 04:53:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 04:53:46,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:53:46,112 INFO L87 Difference]: Start difference. First operand 133 states and 170 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:46,201 INFO L93 Difference]: Finished difference Result 143 states and 179 transitions. [2023-02-18 04:53:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:53:46,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-02-18 04:53:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:46,203 INFO L225 Difference]: With dead ends: 143 [2023-02-18 04:53:46,203 INFO L226 Difference]: Without dead ends: 143 [2023-02-18 04:53:46,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:53:46,204 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 24 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:46,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 425 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-18 04:53:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2023-02-18 04:53:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 125 states have internal predecessors, (155), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2023-02-18 04:53:46,209 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 26 [2023-02-18 04:53:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:46,210 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2023-02-18 04:53:46,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2023-02-18 04:53:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 04:53:46,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:46,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:46,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:46,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:46,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1223684762, now seen corresponding path program 1 times [2023-02-18 04:53:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:46,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127588203] [2023-02-18 04:53:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:46,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:46,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:46,419 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:46,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 04:53:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:46,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 04:53:46,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:46,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:46,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:46,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127588203] [2023-02-18 04:53:46,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127588203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:46,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:46,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-18 04:53:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020632688] [2023-02-18 04:53:46,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 04:53:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 04:53:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:53:46,757 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:53:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:47,683 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2023-02-18 04:53:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 04:53:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-02-18 04:53:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:47,686 INFO L225 Difference]: With dead ends: 326 [2023-02-18 04:53:47,686 INFO L226 Difference]: Without dead ends: 326 [2023-02-18 04:53:47,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2023-02-18 04:53:47,687 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 681 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:47,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1570 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 04:53:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-02-18 04:53:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 162. [2023-02-18 04:53:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 150 states have internal predecessors, (193), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2023-02-18 04:53:47,694 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 27 [2023-02-18 04:53:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:47,695 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2023-02-18 04:53:47,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:53:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2023-02-18 04:53:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:53:47,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:47,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:47,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:47,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:47,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2020711139, now seen corresponding path program 1 times [2023-02-18 04:53:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:47,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029159860] [2023-02-18 04:53:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:47,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:47,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:47,903 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:47,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 04:53:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:47,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 04:53:47,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:47,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:47,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:47,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029159860] [2023-02-18 04:53:47,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029159860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:47,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:47,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:53:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74487747] [2023-02-18 04:53:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:47,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:53:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:53:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:53:47,958 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:47,972 INFO L93 Difference]: Finished difference Result 202 states and 260 transitions. [2023-02-18 04:53:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:53:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 04:53:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:47,975 INFO L225 Difference]: With dead ends: 202 [2023-02-18 04:53:47,975 INFO L226 Difference]: Without dead ends: 202 [2023-02-18 04:53:47,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-18 04:53:47,977 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 32 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:47,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-18 04:53:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2023-02-18 04:53:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 151 states have internal predecessors, (193), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2023-02-18 04:53:47,986 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 29 [2023-02-18 04:53:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:47,987 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2023-02-18 04:53:47,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2023-02-18 04:53:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 04:53:47,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:47,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:48,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-02-18 04:53:48,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:48,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2065321044, now seen corresponding path program 1 times [2023-02-18 04:53:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:48,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768365506] [2023-02-18 04:53:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:48,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:48,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 04:53:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:48,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 04:53:48,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:48,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:48,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768365506] [2023-02-18 04:53:48,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768365506] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:48,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:48,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 04:53:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85160691] [2023-02-18 04:53:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:53:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:53:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:53:48,287 INFO L87 Difference]: Start difference. First operand 163 states and 211 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:48,370 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2023-02-18 04:53:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:53:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-18 04:53:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:48,372 INFO L225 Difference]: With dead ends: 162 [2023-02-18 04:53:48,372 INFO L226 Difference]: Without dead ends: 162 [2023-02-18 04:53:48,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-18 04:53:48,373 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 125 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:48,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 112 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-18 04:53:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-02-18 04:53:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 150 states have internal predecessors, (191), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 209 transitions. [2023-02-18 04:53:48,378 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 209 transitions. Word has length 28 [2023-02-18 04:53:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:48,378 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 209 transitions. [2023-02-18 04:53:48,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2023-02-18 04:53:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 04:53:48,379 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:48,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:48,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:48,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:48,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2065321045, now seen corresponding path program 1 times [2023-02-18 04:53:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:48,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362797757] [2023-02-18 04:53:48,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:48,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:48,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:48,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 04:53:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:48,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 04:53:48,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:48,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:48,761 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 45 treesize of output 41 [2023-02-18 04:53:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:48,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:48,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362797757] [2023-02-18 04:53:48,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362797757] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:48,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:48,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-18 04:53:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015810168] [2023-02-18 04:53:48,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:48,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 04:53:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:48,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 04:53:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:53:48,805 INFO L87 Difference]: Start difference. First operand 162 states and 209 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:50,258 INFO L93 Difference]: Finished difference Result 418 states and 541 transitions. [2023-02-18 04:53:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 04:53:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-02-18 04:53:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:50,261 INFO L225 Difference]: With dead ends: 418 [2023-02-18 04:53:50,261 INFO L226 Difference]: Without dead ends: 418 [2023-02-18 04:53:50,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:53:50,262 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 830 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:50,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 640 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 04:53:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-18 04:53:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 166. [2023-02-18 04:53:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 154 states have internal predecessors, (197), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 04:53:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2023-02-18 04:53:50,278 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 28 [2023-02-18 04:53:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:50,279 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2023-02-18 04:53:50,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2023-02-18 04:53:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 04:53:50,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:50,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:50,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:50,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:50,491 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 143992616, now seen corresponding path program 1 times [2023-02-18 04:53:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:50,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463035827] [2023-02-18 04:53:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:50,493 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:50,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 04:53:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:50,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 04:53:50,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:50,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:53:50,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:50,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463035827] [2023-02-18 04:53:50,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463035827] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:50,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:50,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-18 04:53:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801346579] [2023-02-18 04:53:50,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 04:53:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 04:53:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:53:50,852 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:53:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:51,365 INFO L93 Difference]: Finished difference Result 256 states and 320 transitions. [2023-02-18 04:53:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 04:53:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-02-18 04:53:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:51,368 INFO L225 Difference]: With dead ends: 256 [2023-02-18 04:53:51,368 INFO L226 Difference]: Without dead ends: 256 [2023-02-18 04:53:51,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-18 04:53:51,369 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 724 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:51,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1045 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:53:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-18 04:53:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 176. [2023-02-18 04:53:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 147 states have (on average 1.3877551020408163) internal successors, (204), 163 states have internal predecessors, (204), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 226 transitions. [2023-02-18 04:53:51,375 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 226 transitions. Word has length 30 [2023-02-18 04:53:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:51,375 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 226 transitions. [2023-02-18 04:53:51,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:53:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 226 transitions. [2023-02-18 04:53:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:53:51,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:51,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:51,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:51,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:51,585 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:51,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash -399557048, now seen corresponding path program 1 times [2023-02-18 04:53:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:51,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098708821] [2023-02-18 04:53:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:51,587 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-18 04:53:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:51,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 04:53:51,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:51,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:51,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 04:53:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 04:53:51,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:51,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098708821] [2023-02-18 04:53:51,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098708821] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:51,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:51,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 04:53:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581099226] [2023-02-18 04:53:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:51,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 04:53:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:51,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 04:53:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 04:53:51,663 INFO L87 Difference]: Start difference. First operand 176 states and 226 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:51,764 INFO L93 Difference]: Finished difference Result 175 states and 224 transitions. [2023-02-18 04:53:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 04:53:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 04:53:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:51,765 INFO L225 Difference]: With dead ends: 175 [2023-02-18 04:53:51,765 INFO L226 Difference]: Without dead ends: 175 [2023-02-18 04:53:51,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-18 04:53:51,766 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 121 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:51,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-18 04:53:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-18 04:53:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 162 states have internal predecessors, (202), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions. [2023-02-18 04:53:51,779 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 29 [2023-02-18 04:53:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:51,780 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 224 transitions. [2023-02-18 04:53:51,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions. [2023-02-18 04:53:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:53:51,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:51,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:51,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:51,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:51,991 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash -399557047, now seen corresponding path program 1 times [2023-02-18 04:53:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:51,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909278217] [2023-02-18 04:53:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:51,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:51,993 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:51,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-18 04:53:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:52,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:53:52,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:52,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:52,179 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 53 treesize of output 49 [2023-02-18 04:53:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:52,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 04:53:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909278217] [2023-02-18 04:53:52,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909278217] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:52,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:52,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-18 04:53:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096664558] [2023-02-18 04:53:52,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:52,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 04:53:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 04:53:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 04:53:52,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-18 04:53:52,247 INFO L87 Difference]: Start difference. First operand 175 states and 224 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:53,830 INFO L93 Difference]: Finished difference Result 478 states and 617 transitions. [2023-02-18 04:53:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 04:53:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 04:53:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:53,833 INFO L225 Difference]: With dead ends: 478 [2023-02-18 04:53:53,833 INFO L226 Difference]: Without dead ends: 478 [2023-02-18 04:53:53,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:53:53,834 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 690 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:53,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 638 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-18 04:53:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-02-18 04:53:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 183. [2023-02-18 04:53:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 155 states have (on average 1.367741935483871) internal successors, (212), 170 states have internal predecessors, (212), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 04:53:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2023-02-18 04:53:53,845 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 29 [2023-02-18 04:53:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:53,846 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2023-02-18 04:53:53,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 04:53:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2023-02-18 04:53:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 04:53:53,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:53,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:53,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:54,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:54,047 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-02-18 04:53:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash -85984087, now seen corresponding path program 2 times [2023-02-18 04:53:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 04:53:54,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570283521] [2023-02-18 04:53:54,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:53:54,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:54,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 04:53:54,049 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 04:53:54,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-18 04:53:54,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:53:54,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-18 04:53:54,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 04:53:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 04:53:54,198 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-18 04:53:54,198 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 04:53:54,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-02-18 04:53:54,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-02-18 04:53:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-02-18 04:53:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-02-18 04:53:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-02-18 04:53:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-02-18 04:53:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-02-18 04:53:54,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-02-18 04:53:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-02-18 04:53:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-02-18 04:53:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-02-18 04:53:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-02-18 04:53:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-02-18 04:53:54,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-02-18 04:53:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-02-18 04:53:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-02-18 04:53:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-02-18 04:53:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2023-02-18 04:53:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2023-02-18 04:53:54,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2023-02-18 04:53:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-02-18 04:53:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-02-18 04:53:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-02-18 04:53:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-02-18 04:53:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-02-18 04:53:54,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2023-02-18 04:53:54,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:54,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 04:53:54,407 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:54,410 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 04:53:54,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 04:53:54 BoogieIcfgContainer [2023-02-18 04:53:54,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 04:53:54,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 04:53:54,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 04:53:54,438 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 04:53:54,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:53:34" (3/4) ... [2023-02-18 04:53:54,440 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 04:53:54,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 04:53:54,440 INFO L158 Benchmark]: Toolchain (without parser) took 20852.93ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 54.8MB in the beginning and 57.0MB in the end (delta: -2.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2023-02-18 04:53:54,440 INFO L158 Benchmark]: CDTParser took 1.51ms. Allocated memory is still 60.8MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:53:54,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.37ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 53.8MB in the end (delta: 809.8kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-18 04:53:54,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.28ms. Allocated memory is still 79.7MB. Free memory was 53.8MB in the beginning and 51.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:53:54,441 INFO L158 Benchmark]: Boogie Preprocessor took 57.37ms. Allocated memory is still 79.7MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 04:53:54,441 INFO L158 Benchmark]: RCFGBuilder took 627.97ms. Allocated memory is still 79.7MB. Free memory was 49.6MB in the beginning and 29.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-18 04:53:54,441 INFO L158 Benchmark]: TraceAbstraction took 19611.72ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 56.5MB in the beginning and 57.0MB in the end (delta: -579.2kB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-02-18 04:53:54,441 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 96.5MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 04:53:54,442 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51ms. Allocated memory is still 60.8MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.37ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 53.8MB in the end (delta: 809.8kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.28ms. Allocated memory is still 79.7MB. Free memory was 53.8MB in the beginning and 51.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.37ms. Allocated memory is still 79.7MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 627.97ms. Allocated memory is still 79.7MB. Free memory was 49.6MB in the beginning and 29.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19611.72ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 56.5MB in the beginning and 57.0MB in the end (delta: -579.2kB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 96.5MB. Free memory is still 57.0MB. There was no memory consumed. 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 - UnprovableResult [Line: 1128]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1128. Possible FailurePath: [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1132] CALL assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1132] RET assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [pat_len=2] [L1133] CALL assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L1133] RET assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [a_len=0, pat_len=2] [L1134] int *pat=malloc(sizeof(int)*pat_len); [L1135] int *a=malloc(sizeof(int)*a_len); [L1139] int j = 0; VAL [a={3:0}, a_len=0, j=0, pat={-2147483646:0}, pat_len=2] [L1139] COND TRUE j < pat_len VAL [a={3:0}, a_len=0, j=0, pat={-2147483646:0}, pat_len=2] [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={3:0}, a_len=0, j=0, pat={-2147483646:0}, pat_len=2] [L1139] j++ VAL [a={3:0}, a_len=0, j=1, pat={-2147483646:0}, pat_len=2] [L1139] COND TRUE j < pat_len VAL [a={3:0}, a_len=0, j=1, pat={-2147483646:0}, pat_len=2] [L1140] pat[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={3:0}, a_len=0, j=1, pat={-2147483646:0}, pat_len=2] [L1139] j++ VAL [a={3:0}, a_len=0, j=2, pat={-2147483646:0}, pat_len=2] [L1139] COND FALSE !(j < pat_len) VAL [a={3:0}, a_len=0, j=2, pat={-2147483646:0}, pat_len=2] [L1142] int j = 0; VAL [a={3:0}, a_len=0, j=2, j=0, pat={-2147483646:0}, pat_len=2] [L1142] COND FALSE !(j < a_len) VAL [a={3:0}, a_len=0, j=2, j=0, pat={-2147483646:0}, pat_len=2] [L1147] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L1106] COND TRUE pat_length>a_length+1 [L1107] return 0; VAL [\old(a_length)=0, \old(pat_length)=2, \result=0, a={3:0}, a={3:0}, a_length=0, pat={-2147483646:0}, pat={-2147483646:0}, pat_length=2] [L1147] RET is_relaxed_prefix(pat, pat_len, a, a_len) [L1147] COND FALSE !(is_relaxed_prefix(pat, pat_len, a, a_len)) [L1163] COND FALSE !(pat_len<=a_len+1) VAL [a={3:0}, a_len=0, j=0, j=2, pat={-2147483646:0}, pat_len=2] [L1176] return 0; VAL [\result=0, a={3:0}, a_len=0, j=0, j=2, pat={-2147483646:0}, pat_len=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 93 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6511 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6449 mSDsluCounter, 7864 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6089 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4276 IncrementalHoareTripleChecker+Invalid, 4952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 1775 mSDtfsCounter, 4276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 429 SyntacticMatches, 9 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=17, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1376 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 566 ConstructedInterpolants, 6 QuantifiedInterpolants, 4986 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1149 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 93/136 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-18 04:53:54,461 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: UNKNOWN: Overapproximated counterexample