./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.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 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:11:09,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:11:09,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:11:09,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:11:09,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:11:09,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:11:09,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:11:09,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:11:09,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:11:09,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:11:09,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:11:09,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:11:09,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:11:09,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:11:09,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:11:09,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:11:09,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:11:09,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:11:09,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:11:09,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:11:09,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:11:09,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:11:09,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:11:09,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:11:09,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:11:09,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:11:09,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:11:09,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:11:09,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:11:09,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:11:09,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:11:09,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:11:09,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:11:09,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:11:09,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:11:09,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:11:09,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:11:09,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:11:09,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:11:09,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:11:09,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:11:09,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:11:09,676 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:11:09,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:11:09,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:11:09,679 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:11:09,680 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:11:09,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:11:09,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:11:09,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:11:09,680 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:11:09,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:11:09,681 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:11:09,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:11:09,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:11:09,683 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:11:09,683 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:11:09,683 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:11:09,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:11:09,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:11:09,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:11:09,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:11:09,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:11:09,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:11:09,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:11:09,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:11:09,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:11:09,685 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:11:09,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:11:09,685 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:11:09,685 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 -> 9e6ddc72db9996307e31b37c1f23ddad101cfdc849bb3a24fd3b76db809c7055 [2023-02-15 01:11:09,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:11:09,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:11:09,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:11:09,917 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:11:09,917 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:11:09,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2023-02-15 01:11:10,892 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:11:11,060 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:11:11,061 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag_1.i [2023-02-15 01:11:11,082 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b333e1b24/f056d5efc3e84569a84573bdfea4411e/FLAG35d84dfcd [2023-02-15 01:11:11,091 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b333e1b24/f056d5efc3e84569a84573bdfea4411e [2023-02-15 01:11:11,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:11:11,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:11:11,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:11:11,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:11:11,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:11:11,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fba3ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11, skipping insertion in model container [2023-02-15 01:11:11,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:11:11,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:11:11,360 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/list-ext-properties/list-ext_flag_1.i[23654,23667] [2023-02-15 01:11:11,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:11:11,373 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:11:11,411 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/list-ext-properties/list-ext_flag_1.i[23654,23667] [2023-02-15 01:11:11,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:11:11,433 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:11:11,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11 WrapperNode [2023-02-15 01:11:11,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:11:11,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:11:11,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:11:11,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:11:11,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,476 INFO L138 Inliner]: procedures = 124, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 113 [2023-02-15 01:11:11,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:11:11,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:11:11,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:11:11,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:11:11,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,494 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:11:11,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:11:11,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:11:11,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:11:11,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (1/1) ... [2023-02-15 01:11:11,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:11:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:11,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:11:11,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:11:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 01:11:11,546 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 01:11:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:11:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:11:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:11:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:11:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:11:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:11:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:11:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:11:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:11:11,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:11:11,615 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:11:11,616 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:11:11,650 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 01:11:11,889 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:11:11,894 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:11:11,894 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 01:11:11,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:11:11 BoogieIcfgContainer [2023-02-15 01:11:11,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:11:11,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:11:11,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:11:11,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:11:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:11:11" (1/3) ... [2023-02-15 01:11:11,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34390dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:11:11, skipping insertion in model container [2023-02-15 01:11:11,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:11:11" (2/3) ... [2023-02-15 01:11:11,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34390dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:11:11, skipping insertion in model container [2023-02-15 01:11:11,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:11:11" (3/3) ... [2023-02-15 01:11:11,902 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1.i [2023-02-15 01:11:11,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:11:11,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-02-15 01:11:11,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:11:11,954 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;@2cf6ed83, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:11:11,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2023-02-15 01:11:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:11:11,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:11,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:11:11,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517928, now seen corresponding path program 1 times [2023-02-15 01:11:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665201305] [2023-02-15 01:11:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:12,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:12,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665201305] [2023-02-15 01:11:12,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665201305] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:12,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:12,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:11:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155617280] [2023-02-15 01:11:12,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:12,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:11:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:11:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:11:12,141 INFO L87 Difference]: Start difference. First operand has 91 states, 48 states have (on average 2.125) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:12,162 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-02-15 01:11:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:11:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 01:11:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:12,170 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:11:12,170 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 01:11:12,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:11:12,174 INFO L413 NwaCegarLoop]: 100 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, 100 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-15 01:11:12,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:11:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 01:11:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 01:11:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-02-15 01:11:12,204 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2023-02-15 01:11:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:12,204 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-02-15 01:11:12,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-02-15 01:11:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 01:11:12,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:12,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:11:12,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash 620871761, now seen corresponding path program 1 times [2023-02-15 01:11:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273197669] [2023-02-15 01:11:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:12,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:12,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273197669] [2023-02-15 01:11:12,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273197669] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:12,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:12,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:11:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245060699] [2023-02-15 01:11:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:11:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:11:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:11:12,361 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:12,511 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-02-15 01:11:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:11:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 01:11:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:12,512 INFO L225 Difference]: With dead ends: 96 [2023-02-15 01:11:12,513 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 01:11:12,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 01:11:12,514 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 153 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:12,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 01:11:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2023-02-15 01:11:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.75) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-02-15 01:11:12,521 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 8 [2023-02-15 01:11:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:12,521 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-02-15 01:11:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-02-15 01:11:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 01:11:12,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:12,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:11:12,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 620871762, now seen corresponding path program 1 times [2023-02-15 01:11:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300559033] [2023-02-15 01:11:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:12,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300559033] [2023-02-15 01:11:12,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300559033] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:12,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:12,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:11:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53567226] [2023-02-15 01:11:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:12,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:11:12,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:11:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:11:12,616 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:12,736 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2023-02-15 01:11:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:11:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 01:11:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:12,741 INFO L225 Difference]: With dead ends: 116 [2023-02-15 01:11:12,741 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 01:11:12,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 01:11:12,743 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 168 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:12,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 56 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 01:11:12,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2023-02-15 01:11:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5394736842105263) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-15 01:11:12,749 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 8 [2023-02-15 01:11:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:12,749 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-15 01:11:12,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-15 01:11:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 01:11:12,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:12,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:12,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:11:12,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 623916195, now seen corresponding path program 1 times [2023-02-15 01:11:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:12,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377921679] [2023-02-15 01:11:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:12,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377921679] [2023-02-15 01:11:12,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377921679] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:12,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:12,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:11:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038307977] [2023-02-15 01:11:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:11:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:11:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:11:12,861 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:12,946 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2023-02-15 01:11:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:11:12,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 01:11:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:12,947 INFO L225 Difference]: With dead ends: 132 [2023-02-15 01:11:12,947 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 01:11:12,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:11:12,948 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:12,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 209 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 01:11:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2023-02-15 01:11:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.5324675324675325) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2023-02-15 01:11:12,953 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 15 [2023-02-15 01:11:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:12,953 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2023-02-15 01:11:12,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2023-02-15 01:11:12,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:11:12,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:12,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:12,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:11:12,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1684958094, now seen corresponding path program 1 times [2023-02-15 01:11:12,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:12,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286092793] [2023-02-15 01:11:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:12,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:13,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286092793] [2023-02-15 01:11:13,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286092793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:13,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:13,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:11:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735849303] [2023-02-15 01:11:13,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:13,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:11:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:11:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:11:13,064 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:13,190 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2023-02-15 01:11:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:11:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 01:11:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:13,191 INFO L225 Difference]: With dead ends: 153 [2023-02-15 01:11:13,191 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 01:11:13,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:11:13,192 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:13,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 01:11:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 106. [2023-02-15 01:11:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 80 states have (on average 1.5125) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-02-15 01:11:13,197 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 17 [2023-02-15 01:11:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:13,197 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-02-15 01:11:13,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-02-15 01:11:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:11:13,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:13,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:13,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:11:13,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1529942363, now seen corresponding path program 1 times [2023-02-15 01:11:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237983318] [2023-02-15 01:11:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237983318] [2023-02-15 01:11:13,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237983318] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:13,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:13,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:11:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825944302] [2023-02-15 01:11:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:13,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:11:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:11:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:11:13,243 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:13,313 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2023-02-15 01:11:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:11:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 01:11:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:13,314 INFO L225 Difference]: With dead ends: 112 [2023-02-15 01:11:13,314 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 01:11:13,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 01:11:13,315 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 143 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:13,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 77 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 01:11:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-02-15 01:11:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2023-02-15 01:11:13,319 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 18 [2023-02-15 01:11:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:13,319 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2023-02-15 01:11:13,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2023-02-15 01:11:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 01:11:13,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:13,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:13,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:11:13,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:13,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1395789589, now seen corresponding path program 1 times [2023-02-15 01:11:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:13,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675753074] [2023-02-15 01:11:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:13,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:13,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675753074] [2023-02-15 01:11:13,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675753074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:13,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:11:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690212234] [2023-02-15 01:11:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:13,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:11:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:13,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:11:13,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:11:13,381 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:13,485 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2023-02-15 01:11:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:11:13,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 01:11:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:13,487 INFO L225 Difference]: With dead ends: 138 [2023-02-15 01:11:13,487 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 01:11:13,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:11:13,488 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 73 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:13,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 185 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 01:11:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2023-02-15 01:11:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 111 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2023-02-15 01:11:13,498 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 20 [2023-02-15 01:11:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:13,498 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2023-02-15 01:11:13,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2023-02-15 01:11:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:11:13,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:13,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:13,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:11:13,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534887, now seen corresponding path program 1 times [2023-02-15 01:11:13,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:13,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378572170] [2023-02-15 01:11:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:13,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378572170] [2023-02-15 01:11:13,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378572170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:13,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:13,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:11:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123166527] [2023-02-15 01:11:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:13,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:11:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:11:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:11:13,642 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:13,769 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2023-02-15 01:11:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:11:13,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:11:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:13,771 INFO L225 Difference]: With dead ends: 113 [2023-02-15 01:11:13,772 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 01:11:13,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:11:13,773 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 112 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:13,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 162 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 01:11:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2023-02-15 01:11:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-02-15 01:11:13,782 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 21 [2023-02-15 01:11:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:13,783 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-02-15 01:11:13,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-02-15 01:11:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:11:13,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:13,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:13,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:11:13,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1499534886, now seen corresponding path program 1 times [2023-02-15 01:11:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:13,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146094809] [2023-02-15 01:11:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146094809] [2023-02-15 01:11:13,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146094809] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:13,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:13,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:11:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657373842] [2023-02-15 01:11:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:11:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:11:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:11:13,914 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:14,078 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2023-02-15 01:11:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:11:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 01:11:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:14,079 INFO L225 Difference]: With dead ends: 108 [2023-02-15 01:11:14,079 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 01:11:14,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:11:14,079 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:14,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 219 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 01:11:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2023-02-15 01:11:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2023-02-15 01:11:14,081 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 21 [2023-02-15 01:11:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:14,082 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2023-02-15 01:11:14,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2023-02-15 01:11:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 01:11:14,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:14,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:14,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:11:14,082 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 37796891, now seen corresponding path program 1 times [2023-02-15 01:11:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:14,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670306748] [2023-02-15 01:11:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:14,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670306748] [2023-02-15 01:11:14,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670306748] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:11:14,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:11:14,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:11:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525362854] [2023-02-15 01:11:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:11:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:11:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:11:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:11:14,252 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:14,382 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2023-02-15 01:11:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:11:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 01:11:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:14,383 INFO L225 Difference]: With dead ends: 110 [2023-02-15 01:11:14,383 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 01:11:14,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:11:14,384 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 115 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:14,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 161 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:11:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 01:11:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2023-02-15 01:11:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 82 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2023-02-15 01:11:14,385 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 22 [2023-02-15 01:11:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:14,385 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2023-02-15 01:11:14,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2023-02-15 01:11:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:11:14,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:14,386 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-15 01:11:14,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:11:14,386 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 615949290, now seen corresponding path program 1 times [2023-02-15 01:11:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:14,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29185886] [2023-02-15 01:11:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29185886] [2023-02-15 01:11:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29185886] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145412717] [2023-02-15 01:11:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:14,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:14,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:14,757 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-15 01:11:14,780 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-15 01:11:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:14,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 01:11:14,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:14,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:14,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:14,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-02-15 01:11:15,030 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:11:15,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:11:15,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:15,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:15,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:15,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2023-02-15 01:11:15,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:11:15,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 01:11:15,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 01:11:15,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:15,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 01:11:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:15,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:15,320 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-15 01:11:15,359 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-15 01:11:15,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:15,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2023-02-15 01:11:15,560 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-02-15 01:11:15,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2023-02-15 01:11:15,563 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 22 treesize of output 18 [2023-02-15 01:11:15,570 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:11:15,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-15 01:11:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:11:15,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145412717] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:15,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:15,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 33 [2023-02-15 01:11:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707006064] [2023-02-15 01:11:15,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:15,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 01:11:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:15,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 01:11:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=761, Unknown=5, NotChecked=118, Total=1056 [2023-02-15 01:11:15,626 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:16,387 INFO L93 Difference]: Finished difference Result 197 states and 220 transitions. [2023-02-15 01:11:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:11:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 01:11:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:16,388 INFO L225 Difference]: With dead ends: 197 [2023-02-15 01:11:16,388 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 01:11:16,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=1275, Unknown=8, NotChecked=158, Total=1806 [2023-02-15 01:11:16,389 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 471 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 58 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 396 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:16,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 482 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 728 Invalid, 7 Unknown, 396 Unchecked, 0.5s Time] [2023-02-15 01:11:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 01:11:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 103. [2023-02-15 01:11:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 102 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2023-02-15 01:11:16,391 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 30 [2023-02-15 01:11:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:16,391 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2023-02-15 01:11:16,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2023-02-15 01:11:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:11:16,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:16,392 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-15 01:11:16,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 01:11:16,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 01:11:16,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 615641460, now seen corresponding path program 1 times [2023-02-15 01:11:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:16,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802297152] [2023-02-15 01:11:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:16,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:16,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802297152] [2023-02-15 01:11:16,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802297152] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:16,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329419738] [2023-02-15 01:11:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:16,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:16,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:16,902 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-15 01:11:16,936 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-15 01:11:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:16,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 01:11:16,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:17,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:11:17,107 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:11:17,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:11:17,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:17,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:11:17,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:17,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-15 01:11:17,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:11:17,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:11:17,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:11:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:17,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:17,302 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-15 01:11:17,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_276) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-15 01:11:17,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 01:11:17,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:17,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-15 01:11:17,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 01:11:17,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:17,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-15 01:11:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:11:17,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329419738] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:17,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:17,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2023-02-15 01:11:17,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142603143] [2023-02-15 01:11:17,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:17,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 01:11:17,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:17,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 01:11:17,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=568, Unknown=10, NotChecked=102, Total=812 [2023-02-15 01:11:17,536 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:18,156 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2023-02-15 01:11:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:11:18,157 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 01:11:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:18,158 INFO L225 Difference]: With dead ends: 204 [2023-02-15 01:11:18,158 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 01:11:18,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=983, Unknown=13, NotChecked=138, Total=1406 [2023-02-15 01:11:18,158 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 442 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 53 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:18,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 644 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 775 Invalid, 6 Unknown, 308 Unchecked, 0.4s Time] [2023-02-15 01:11:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 01:11:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 105. [2023-02-15 01:11:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 104 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2023-02-15 01:11:18,160 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 30 [2023-02-15 01:11:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:18,161 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2023-02-15 01:11:18,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2023-02-15 01:11:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:11:18,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:18,161 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-15 01:11:18,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 01:11:18,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 01:11:18,366 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1355563894, now seen corresponding path program 1 times [2023-02-15 01:11:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:18,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050483496] [2023-02-15 01:11:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:18,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050483496] [2023-02-15 01:11:18,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050483496] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:18,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28295288] [2023-02-15 01:11:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:18,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:18,596 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-15 01:11:18,598 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-15 01:11:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:18,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 01:11:18,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:18,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:11:18,764 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:11:18,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:11:18,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:18,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:18,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:11:18,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-15 01:11:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:11:18,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:11:18,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:11:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:18,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:18,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-02-15 01:11:18,924 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-02-15 01:11:19,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:19,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 01:11:19,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:19,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-15 01:11:19,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 01:11:19,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:19,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-15 01:11:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:11:19,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28295288] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:19,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:19,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2023-02-15 01:11:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699172634] [2023-02-15 01:11:19,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:19,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 01:11:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 01:11:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=570, Unknown=7, NotChecked=102, Total=812 [2023-02-15 01:11:19,260 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:22,028 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2023-02-15 01:11:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:11:22,028 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 01:11:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:22,029 INFO L225 Difference]: With dead ends: 218 [2023-02-15 01:11:22,029 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 01:11:22,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=8, NotChecked=134, Total=1332 [2023-02-15 01:11:22,030 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 433 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:22,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 670 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 896 Invalid, 5 Unknown, 340 Unchecked, 0.5s Time] [2023-02-15 01:11:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 01:11:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 123. [2023-02-15 01:11:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 122 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2023-02-15 01:11:22,032 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 30 [2023-02-15 01:11:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:22,032 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2023-02-15 01:11:22,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 29 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2023-02-15 01:11:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:11:22,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:22,033 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2023-02-15 01:11:22,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 01:11:22,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:22,234 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1355871724, now seen corresponding path program 1 times [2023-02-15 01:11:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:22,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445666847] [2023-02-15 01:11:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445666847] [2023-02-15 01:11:22,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445666847] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888144800] [2023-02-15 01:11:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:22,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:22,613 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-15 01:11:22,615 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-15 01:11:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:22,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 01:11:22,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:22,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:22,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:22,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:11:22,751 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:11:22,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:11:22,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:22,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 01:11:22,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:11:22,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:11:22,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:11:22,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:11:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:22,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:22,879 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-15 01:11:22,891 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-15 01:11:22,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2023-02-15 01:11:23,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:23,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2023-02-15 01:11:23,066 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-15 01:11:23,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2023-02-15 01:11:23,070 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 11 treesize of output 7 [2023-02-15 01:11:23,076 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:11:23,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-15 01:11:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:11:23,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888144800] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:23,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:23,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2023-02-15 01:11:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579692663] [2023-02-15 01:11:23,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:23,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:11:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:11:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=413, Unknown=5, NotChecked=132, Total=650 [2023-02-15 01:11:23,128 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:24,477 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2023-02-15 01:11:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:11:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 01:11:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:24,478 INFO L225 Difference]: With dead ends: 229 [2023-02-15 01:11:24,478 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 01:11:24,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=963, Unknown=16, NotChecked=210, Total=1482 [2023-02-15 01:11:24,479 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 415 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 52 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:24,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 926 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1359 Invalid, 32 Unknown, 621 Unchecked, 0.9s Time] [2023-02-15 01:11:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 01:11:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 144. [2023-02-15 01:11:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.3125) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2023-02-15 01:11:24,481 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 30 [2023-02-15 01:11:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:24,481 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2023-02-15 01:11:24,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2023-02-15 01:11:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:11:24,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:24,482 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-02-15 01:11:24,499 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-15 01:11:24,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:24,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025696, now seen corresponding path program 1 times [2023-02-15 01:11:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:24,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610148393] [2023-02-15 01:11:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610148393] [2023-02-15 01:11:24,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610148393] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273678123] [2023-02-15 01:11:24,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:24,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:24,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:24,981 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-15 01:11:24,982 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-15 01:11:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:25,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 01:11:25,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:25,136 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:11:25,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:11:25,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:25,277 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:25,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:11:25,294 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:25,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:11:25,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:11:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:25,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:25,425 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2023-02-15 01:11:27,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2023-02-15 01:11:27,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:27,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-15 01:11:27,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:27,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-02-15 01:11:27,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 01:11:31,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:31,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2023-02-15 01:11:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:11:33,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273678123] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:33,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:33,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-02-15 01:11:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579293504] [2023-02-15 01:11:33,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:33,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 01:11:33,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 01:11:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=8, NotChecked=118, Total=1056 [2023-02-15 01:11:33,529 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:34,096 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2023-02-15 01:11:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:11:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 01:11:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:34,098 INFO L225 Difference]: With dead ends: 232 [2023-02-15 01:11:34,098 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 01:11:34,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=311, Invalid=1171, Unknown=8, NotChecked=150, Total=1640 [2023-02-15 01:11:34,098 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 884 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:34,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 439 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 691 Invalid, 0 Unknown, 278 Unchecked, 0.4s Time] [2023-02-15 01:11:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 01:11:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 147. [2023-02-15 01:11:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 146 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2023-02-15 01:11:34,101 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 32 [2023-02-15 01:11:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:34,101 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2023-02-15 01:11:34,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2023-02-15 01:11:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 01:11:34,101 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:34,101 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-02-15 01:11:34,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 01:11:34,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 01:11:34,302 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025695, now seen corresponding path program 1 times [2023-02-15 01:11:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:34,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950420876] [2023-02-15 01:11:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:34,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:34,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950420876] [2023-02-15 01:11:34,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950420876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:34,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696705331] [2023-02-15 01:11:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:34,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:34,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:34,732 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-15 01:11:34,762 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-15 01:11:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:34,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 01:11:34,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:34,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:11:34,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:11:34,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:11:34,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:34,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:34,976 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:11:34,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:11:34,988 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:34,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:11:35,014 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:35,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 01:11:35,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:11:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:11:35,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:11:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:35,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:35,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_580 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-02-15 01:11:35,206 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_580 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_579) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2023-02-15 01:11:35,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:35,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 01:11:35,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:35,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 01:11:35,277 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 7 treesize of output 3 [2023-02-15 01:11:35,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:35,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 01:11:35,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:35,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-15 01:11:35,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:11:35,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:35,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 01:11:35,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:11:35,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:11:35,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 01:11:35,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:35,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-15 01:11:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:11:35,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696705331] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:35,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:35,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 26 [2023-02-15 01:11:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601368728] [2023-02-15 01:11:35,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 01:11:35,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:35,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 01:11:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=494, Unknown=16, NotChecked=94, Total=702 [2023-02-15 01:11:35,491 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 27 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:40,427 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2023-02-15 01:11:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 01:11:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 01:11:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:40,428 INFO L225 Difference]: With dead ends: 244 [2023-02-15 01:11:40,428 INFO L226 Difference]: Without dead ends: 244 [2023-02-15 01:11:40,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=380, Invalid=1410, Unknown=24, NotChecked=166, Total=1980 [2023-02-15 01:11:40,429 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 445 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 71 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:40,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 594 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 762 Invalid, 1 Unknown, 418 Unchecked, 0.4s Time] [2023-02-15 01:11:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-02-15 01:11:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 145. [2023-02-15 01:11:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2023-02-15 01:11:40,431 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 32 [2023-02-15 01:11:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:40,431 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2023-02-15 01:11:40,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2023-02-15 01:11:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:11:40,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:40,432 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-02-15 01:11:40,438 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-15 01:11:40,637 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-15 01:11:40,637 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1553010291, now seen corresponding path program 1 times [2023-02-15 01:11:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:40,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077111687] [2023-02-15 01:11:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:40,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077111687] [2023-02-15 01:11:40,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077111687] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817868640] [2023-02-15 01:11:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:40,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:40,887 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-15 01:11:40,936 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-15 01:11:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:40,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 01:11:40,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:41,058 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:11:41,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:11:41,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:41,162 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:41,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 01:11:41,173 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:41,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-15 01:11:41,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:41,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2023-02-15 01:11:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:41,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:41,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:41,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-02-15 01:11:41,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:41,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-15 01:11:41,387 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 20 treesize of output 18 [2023-02-15 01:11:41,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:41,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2023-02-15 01:11:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:41,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817868640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:41,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:41,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 29 [2023-02-15 01:11:41,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423859756] [2023-02-15 01:11:41,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:41,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 01:11:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 01:11:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=707, Unknown=16, NotChecked=0, Total=812 [2023-02-15 01:11:41,546 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:11:42,684 INFO L93 Difference]: Finished difference Result 294 states and 334 transitions. [2023-02-15 01:11:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 01:11:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 01:11:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:11:42,685 INFO L225 Difference]: With dead ends: 294 [2023-02-15 01:11:42,685 INFO L226 Difference]: Without dead ends: 294 [2023-02-15 01:11:42,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=507, Invalid=2447, Unknown=16, NotChecked=0, Total=2970 [2023-02-15 01:11:42,686 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 717 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:11:42,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1116 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 01:11:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-02-15 01:11:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 168. [2023-02-15 01:11:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 167 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2023-02-15 01:11:42,689 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 33 [2023-02-15 01:11:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:11:42,689 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2023-02-15 01:11:42,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:11:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2023-02-15 01:11:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 01:11:42,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:11:42,690 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:11:42,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:11:42,892 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-15 01:11:42,892 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:11:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:11:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1319887619, now seen corresponding path program 1 times [2023-02-15 01:11:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:11:42,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987756555] [2023-02-15 01:11:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:11:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:43,169 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-15 01:11:43,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:11:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987756555] [2023-02-15 01:11:43,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987756555] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:11:43,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384178117] [2023-02-15 01:11:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:11:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:11:43,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:11:43,172 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-15 01:11:43,208 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-15 01:11:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:11:43,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 01:11:43,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:11:43,362 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:11:43,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:11:43,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:11:43,510 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:43,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2023-02-15 01:11:43,529 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:11:43,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 01:11:43,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:43,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 21 [2023-02-15 01:11:43,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 01:11:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:43,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:11:44,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 Int) (v_ArrVal_729 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_729) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) 1)) is different from false [2023-02-15 01:11:44,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:44,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 01:11:44,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:44,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-02-15 01:11:44,108 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 14 treesize of output 12 [2023-02-15 01:11:44,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:11:44,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 155 [2023-02-15 01:11:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:11:44,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384178117] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:11:44,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:11:44,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 39 [2023-02-15 01:11:44,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733581283] [2023-02-15 01:11:44,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:11:44,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 01:11:44,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:11:44,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 01:11:44,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1241, Unknown=18, NotChecked=72, Total=1482 [2023-02-15 01:11:44,659 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:22,035 INFO L93 Difference]: Finished difference Result 289 states and 330 transitions. [2023-02-15 01:12:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-02-15 01:12:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 01:12:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:22,036 INFO L225 Difference]: With dead ends: 289 [2023-02-15 01:12:22,036 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 01:12:22,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=1218, Invalid=6401, Unknown=41, NotChecked=172, Total=7832 [2023-02-15 01:12:22,038 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 685 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 96 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:22,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1112 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1879 Invalid, 9 Unknown, 171 Unchecked, 1.1s Time] [2023-02-15 01:12:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 01:12:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 172. [2023-02-15 01:12:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2023-02-15 01:12:22,041 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 35 [2023-02-15 01:12:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:22,041 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2023-02-15 01:12:22,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.5641025641025643) internal successors, (100), 39 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2023-02-15 01:12:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:12:22,042 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:22,042 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, 1, 1, 1, 1, 1, 1] [2023-02-15 01:12:22,049 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-15 01:12:22,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 01:12:22,248 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1240762011, now seen corresponding path program 1 times [2023-02-15 01:12:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566452951] [2023-02-15 01:12:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:12:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566452951] [2023-02-15 01:12:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566452951] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507275658] [2023-02-15 01:12:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:22,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:22,381 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:22,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 01:12:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:22,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:12:22,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:22,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:12:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:12:22,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:22,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 01:12:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:12:22,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507275658] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:22,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:22,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-15 01:12:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314906228] [2023-02-15 01:12:22,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:22,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:12:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:12:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:12:22,565 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:22,755 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2023-02-15 01:12:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:12:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 01:12:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:22,757 INFO L225 Difference]: With dead ends: 387 [2023-02-15 01:12:22,757 INFO L226 Difference]: Without dead ends: 387 [2023-02-15 01:12:22,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:12:22,757 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 239 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:22,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 370 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:12:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-02-15 01:12:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 210. [2023-02-15 01:12:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.401015228426396) internal successors, (276), 209 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 276 transitions. [2023-02-15 01:12:22,761 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 276 transitions. Word has length 36 [2023-02-15 01:12:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:22,761 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 276 transitions. [2023-02-15 01:12:22,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2023-02-15 01:12:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 01:12:22,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:22,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2023-02-15 01:12:22,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 01:12:22,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:22,962 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1655615668, now seen corresponding path program 1 times [2023-02-15 01:12:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:22,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368052276] [2023-02-15 01:12:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:23,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:23,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368052276] [2023-02-15 01:12:23,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368052276] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:23,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014519912] [2023-02-15 01:12:23,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:23,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:23,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 01:12:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:23,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 01:12:23,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:23,601 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:12:23,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:12:23,605 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 6 treesize of output 5 [2023-02-15 01:12:23,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:23,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:23,779 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:12:23,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:12:23,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:12:23,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:12:23,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:23,834 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:12:23,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2023-02-15 01:12:23,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-02-15 01:12:23,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:12:23,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2023-02-15 01:12:23,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 01:12:23,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:12:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:24,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:24,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 177 [2023-02-15 01:12:24,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:24,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 120 [2023-02-15 01:12:24,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:24,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 96 [2023-02-15 01:12:24,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:24,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 152 [2023-02-15 01:12:24,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:24,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 213 [2023-02-15 01:12:24,524 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 197 treesize of output 185 [2023-02-15 01:12:24,528 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 185 treesize of output 177 [2023-02-15 01:12:24,530 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 177 treesize of output 169 [2023-02-15 01:12:24,534 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 169 treesize of output 157 [2023-02-15 01:12:24,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:24,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-15 01:12:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:24,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014519912] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:24,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:24,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 42 [2023-02-15 01:12:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258070674] [2023-02-15 01:12:24,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:24,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 01:12:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 01:12:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1532, Unknown=5, NotChecked=0, Total=1722 [2023-02-15 01:12:24,867 INFO L87 Difference]: Start difference. First operand 210 states and 276 transitions. Second operand has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:25,808 INFO L93 Difference]: Finished difference Result 217 states and 258 transitions. [2023-02-15 01:12:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:12:25,809 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 01:12:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:25,810 INFO L225 Difference]: With dead ends: 217 [2023-02-15 01:12:25,810 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 01:12:25,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=336, Invalid=2209, Unknown=5, NotChecked=0, Total=2550 [2023-02-15 01:12:25,811 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 569 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:25,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 830 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 01:12:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 01:12:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 178. [2023-02-15 01:12:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 165 states have (on average 1.3333333333333333) internal successors, (220), 177 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2023-02-15 01:12:25,813 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 38 [2023-02-15 01:12:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:25,813 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2023-02-15 01:12:25,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 42 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2023-02-15 01:12:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:12:25,814 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:25,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:12:25,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-15 01:12:26,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:26,018 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1570044186, now seen corresponding path program 1 times [2023-02-15 01:12:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:26,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212730536] [2023-02-15 01:12:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212730536] [2023-02-15 01:12:26,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212730536] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133008915] [2023-02-15 01:12:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:26,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:26,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:26,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 01:12:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:26,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 01:12:26,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:26,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:12:26,803 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:12:26,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:12:26,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:26,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:26,964 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:12:26,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2023-02-15 01:12:26,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:12:26,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:12:26,988 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:12:26,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 01:12:26,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:12:27,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 21 [2023-02-15 01:12:27,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-02-15 01:12:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:12:27,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:27,503 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8))) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2023-02-15 01:12:27,527 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8)))) is different from false [2023-02-15 01:12:27,534 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_957) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))))) is different from false [2023-02-15 01:12:27,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2023-02-15 01:12:27,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-02-15 01:12:27,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2023-02-15 01:12:27,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 81 [2023-02-15 01:12:27,571 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 66 treesize of output 62 [2023-02-15 01:12:27,573 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 32 treesize of output 28 [2023-02-15 01:12:27,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 01:12:27,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:12:27,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:12:27,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-02-15 01:12:27,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:27,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-15 01:12:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2023-02-15 01:12:27,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133008915] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:27,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:27,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 46 [2023-02-15 01:12:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120919489] [2023-02-15 01:12:27,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:27,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 01:12:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 01:12:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1670, Unknown=3, NotChecked=258, Total=2162 [2023-02-15 01:12:27,945 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:29,294 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2023-02-15 01:12:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 01:12:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 01:12:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:29,295 INFO L225 Difference]: With dead ends: 230 [2023-02-15 01:12:29,295 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 01:12:29,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=937, Invalid=4328, Unknown=3, NotChecked=432, Total=5700 [2023-02-15 01:12:29,298 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 878 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:29,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 599 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1057 Invalid, 0 Unknown, 480 Unchecked, 0.5s Time] [2023-02-15 01:12:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 01:12:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 182. [2023-02-15 01:12:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 181 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2023-02-15 01:12:29,302 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 43 [2023-02-15 01:12:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2023-02-15 01:12:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2023-02-15 01:12:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:12:29,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:29,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:12:29,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 01:12:29,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 01:12:29,510 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1048082290, now seen corresponding path program 2 times [2023-02-15 01:12:29,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051567435] [2023-02-15 01:12:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051567435] [2023-02-15 01:12:29,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051567435] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518465674] [2023-02-15 01:12:29,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:12:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:29,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:29,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:29,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 01:12:30,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:12:30,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:12:30,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:12:30,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:30,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:30,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:12:30,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-02-15 01:12:30,169 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:12:30,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:12:30,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-02-15 01:12:30,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:30,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:12:30,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 01:12:30,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 01:12:30,361 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 01:12:30,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:12:30,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 01:12:30,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:30,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:30,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 01:12:30,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2023-02-15 01:12:30,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 01:12:30,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-15 01:12:30,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:12:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:30,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:30,484 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1084 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-15 01:12:30,504 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1084 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-15 01:12:30,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1084 (Array Int Int))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1084) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2023-02-15 01:12:30,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:30,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2023-02-15 01:12:30,857 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-15 01:12:30,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 137 [2023-02-15 01:12:30,861 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 126 treesize of output 110 [2023-02-15 01:12:30,863 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 110 treesize of output 102 [2023-02-15 01:12:30,880 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-02-15 01:12:30,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 01:12:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-15 01:12:30,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518465674] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:30,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:30,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2023-02-15 01:12:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295752101] [2023-02-15 01:12:30,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-15 01:12:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-15 01:12:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1116, Unknown=5, NotChecked=216, Total=1560 [2023-02-15 01:12:30,936 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:32,018 INFO L93 Difference]: Finished difference Result 323 states and 392 transitions. [2023-02-15 01:12:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:12:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 01:12:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:32,038 INFO L225 Difference]: With dead ends: 323 [2023-02-15 01:12:32,038 INFO L226 Difference]: Without dead ends: 323 [2023-02-15 01:12:32,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=472, Invalid=1884, Unknown=8, NotChecked=288, Total=2652 [2023-02-15 01:12:32,038 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 366 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 67 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:32,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 697 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1023 Invalid, 3 Unknown, 488 Unchecked, 0.6s Time] [2023-02-15 01:12:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-02-15 01:12:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 203. [2023-02-15 01:12:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 191 states have (on average 1.3036649214659686) internal successors, (249), 202 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2023-02-15 01:12:32,041 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 43 [2023-02-15 01:12:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:32,041 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2023-02-15 01:12:32,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2023-02-15 01:12:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:12:32,042 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:32,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:12:32,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:12:32,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 01:12:32,246 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:32,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1047774460, now seen corresponding path program 2 times [2023-02-15 01:12:32,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:32,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197974719] [2023-02-15 01:12:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197974719] [2023-02-15 01:12:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197974719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75493860] [2023-02-15 01:12:32,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:12:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:32,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:32,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 01:12:32,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:12:32,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:12:32,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 01:12:32,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:32,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:12:32,895 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:12:32,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:12:32,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:12:32,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:12:32,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:32,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-15 01:12:33,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:33,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:33,108 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 01:12:33,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:12:33,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:33,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:33,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2023-02-15 01:12:33,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:33,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:33,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:12:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:33,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:33,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1206) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-15 01:12:33,306 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1206 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1206) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-15 01:12:33,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2023-02-15 01:12:33,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:33,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 117 [2023-02-15 01:12:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:12:34,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75493860] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:34,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:34,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2023-02-15 01:12:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327711291] [2023-02-15 01:12:34,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:34,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 01:12:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:34,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 01:12:34,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1131, Unknown=2, NotChecked=142, Total=1482 [2023-02-15 01:12:34,217 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:35,340 INFO L93 Difference]: Finished difference Result 329 states and 398 transitions. [2023-02-15 01:12:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:12:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 01:12:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:35,342 INFO L225 Difference]: With dead ends: 329 [2023-02-15 01:12:35,342 INFO L226 Difference]: Without dead ends: 329 [2023-02-15 01:12:35,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=504, Invalid=2152, Unknown=4, NotChecked=202, Total=2862 [2023-02-15 01:12:35,343 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 458 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 66 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:35,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 751 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1001 Invalid, 3 Unknown, 254 Unchecked, 0.5s Time] [2023-02-15 01:12:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-02-15 01:12:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 205. [2023-02-15 01:12:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 204 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2023-02-15 01:12:35,346 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 43 [2023-02-15 01:12:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:35,346 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2023-02-15 01:12:35,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2023-02-15 01:12:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:12:35,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:35,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:12:35,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:12:35,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 01:12:35,547 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1554014930, now seen corresponding path program 1 times [2023-02-15 01:12:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:35,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261244222] [2023-02-15 01:12:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:35,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:35,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261244222] [2023-02-15 01:12:35,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261244222] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:35,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876491730] [2023-02-15 01:12:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:35,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:35,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:35,927 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:35,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:12:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:36,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 01:12:36,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:36,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:12:36,178 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:12:36,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:12:36,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:36,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:12:36,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:12:36,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-15 01:12:36,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:36,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:36,384 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 01:12:36,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:12:36,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:36,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:36,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2023-02-15 01:12:36,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:36,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:12:36,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:12:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:36,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:36,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-02-15 01:12:36,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1328) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-02-15 01:12:36,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2023-02-15 01:12:37,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:37,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 117 [2023-02-15 01:12:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:12:37,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876491730] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:37,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:37,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2023-02-15 01:12:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583597460] [2023-02-15 01:12:37,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:37,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 01:12:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 01:12:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1131, Unknown=2, NotChecked=142, Total=1482 [2023-02-15 01:12:37,341 INFO L87 Difference]: Start difference. First operand 205 states and 251 transitions. Second operand has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:12:38,849 INFO L93 Difference]: Finished difference Result 342 states and 412 transitions. [2023-02-15 01:12:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 01:12:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 01:12:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:12:38,852 INFO L225 Difference]: With dead ends: 342 [2023-02-15 01:12:38,852 INFO L226 Difference]: Without dead ends: 342 [2023-02-15 01:12:38,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=569, Invalid=2403, Unknown=6, NotChecked=214, Total=3192 [2023-02-15 01:12:38,853 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 382 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 70 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:12:38,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1044 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1479 Invalid, 9 Unknown, 288 Unchecked, 0.8s Time] [2023-02-15 01:12:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-02-15 01:12:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 205. [2023-02-15 01:12:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 193 states have (on average 1.2953367875647668) internal successors, (250), 204 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 250 transitions. [2023-02-15 01:12:38,856 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 250 transitions. Word has length 43 [2023-02-15 01:12:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:12:38,856 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 250 transitions. [2023-02-15 01:12:38,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 39 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 250 transitions. [2023-02-15 01:12:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:12:38,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:12:38,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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-15 01:12:38,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-15 01:12:39,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:39,062 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:12:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:12:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926888, now seen corresponding path program 2 times [2023-02-15 01:12:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:12:39,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767762687] [2023-02-15 01:12:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:12:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:12:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:12:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:12:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767762687] [2023-02-15 01:12:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767762687] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:12:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738424779] [2023-02-15 01:12:39,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:12:39,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:12:39,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:12:39,541 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:12:39,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 01:12:39,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:12:39,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:12:39,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 01:12:39,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:12:39,748 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:12:39,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:12:39,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:12:39,851 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:12:39,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:12:39,876 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:12:39,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:12:39,888 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 01:12:39,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 01:12:39,932 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 01:12:39,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-02-15 01:12:40,038 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:12:40,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 59 [2023-02-15 01:12:40,075 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:12:40,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 59 [2023-02-15 01:12:40,195 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:12:40,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2023-02-15 01:12:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:12:40,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:12:40,240 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1445 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2023-02-15 01:12:40,327 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2023-02-15 01:12:40,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-02-15 01:12:40,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:40,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-15 01:12:40,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:40,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 01:12:40,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:40,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-02-15 01:12:40,552 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 142 treesize of output 126 [2023-02-15 01:12:40,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:40,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2023-02-15 01:12:40,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:12:40,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2023-02-15 01:12:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:12:42,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738424779] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:12:42,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:12:42,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 43 [2023-02-15 01:12:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076832623] [2023-02-15 01:12:42,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:12:42,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 01:12:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:12:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 01:12:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1560, Unknown=16, NotChecked=82, Total=1892 [2023-02-15 01:12:42,525 INFO L87 Difference]: Start difference. First operand 205 states and 250 transitions. Second operand has 44 states, 43 states have (on average 2.953488372093023) internal successors, (127), 44 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:12:44,624 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-15 01:12:46,627 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-15 01:12:50,831 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, 1] [2023-02-15 01:12:52,845 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-15 01:12:54,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:12:56,921 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, 1] [2023-02-15 01:12:58,942 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-15 01:13:01,020 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-15 01:13:03,038 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-15 01:13:10,029 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 53 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:13:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:13:10,776 INFO L93 Difference]: Finished difference Result 353 states and 430 transitions. [2023-02-15 01:13:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 01:13:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.953488372093023) internal successors, (127), 44 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-15 01:13:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:13:10,778 INFO L225 Difference]: With dead ends: 353 [2023-02-15 01:13:10,778 INFO L226 Difference]: Without dead ends: 353 [2023-02-15 01:13:10,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=610, Invalid=3038, Unknown=16, NotChecked=118, Total=3782 [2023-02-15 01:13:10,779 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 801 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 85 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:13:10,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 978 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1574 Invalid, 10 Unknown, 175 Unchecked, 19.5s Time] [2023-02-15 01:13:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-15 01:13:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 233. [2023-02-15 01:13:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 221 states have (on average 1.2805429864253393) internal successors, (283), 232 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 283 transitions. [2023-02-15 01:13:10,782 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 283 transitions. Word has length 45 [2023-02-15 01:13:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:13:10,782 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 283 transitions. [2023-02-15 01:13:10,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.953488372093023) internal successors, (127), 44 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 283 transitions. [2023-02-15 01:13:10,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:13:10,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:13:10,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 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-15 01:13:10,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 01:13:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:13:10,988 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:13:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:13:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1888926889, now seen corresponding path program 2 times [2023-02-15 01:13:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:13:10,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972933360] [2023-02-15 01:13:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:13:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:13:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:13:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:13:11,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972933360] [2023-02-15 01:13:11,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972933360] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:13:11,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747987786] [2023-02-15 01:13:11,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:13:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:13:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:13:11,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:13:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 01:13:11,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:13:11,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:13:11,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 01:13:11,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:13:11,791 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:13:11,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:13:11,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:13:11,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:13:11,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:11,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:11,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:11,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:11,914 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:13:11,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:13:11,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:13:11,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:12,074 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 01:13:12,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2023-02-15 01:13:12,082 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 16 treesize of output 8 [2023-02-15 01:13:12,099 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:13:12,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:13:12,164 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:13:12,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:13:12,198 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 01:13:12,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 73 [2023-02-15 01:13:12,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:13:12,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:13:12,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2023-02-15 01:13:12,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:13:12,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 01:13:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:12,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:13:12,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:12,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 85 [2023-02-15 01:13:13,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,130 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-15 01:13:13,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 124 [2023-02-15 01:13:13,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 114 [2023-02-15 01:13:13,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 169 [2023-02-15 01:13:13,778 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 153 treesize of output 145 [2023-02-15 01:13:13,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 130 [2023-02-15 01:13:13,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 168 [2023-02-15 01:13:13,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:13,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 226 [2023-02-15 01:13:13,834 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 191 treesize of output 183 [2023-02-15 01:13:13,838 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 183 treesize of output 179 [2023-02-15 01:13:13,842 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 179 treesize of output 175 [2023-02-15 01:13:13,846 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 175 treesize of output 167 [2023-02-15 01:13:15,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:15,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 126 [2023-02-15 01:13:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:15,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747987786] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:13:15,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:13:15,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 44 [2023-02-15 01:13:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113311658] [2023-02-15 01:13:15,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:13:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 01:13:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:13:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 01:13:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1755, Unknown=21, NotChecked=0, Total=1980 [2023-02-15 01:13:15,688 INFO L87 Difference]: Start difference. First operand 233 states and 283 transitions. Second operand has 45 states, 44 states have (on average 2.590909090909091) internal successors, (114), 45 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:13:20,705 INFO L93 Difference]: Finished difference Result 389 states and 467 transitions. [2023-02-15 01:13:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 01:13:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.590909090909091) internal successors, (114), 45 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-15 01:13:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:13:20,706 INFO L225 Difference]: With dead ends: 389 [2023-02-15 01:13:20,706 INFO L226 Difference]: Without dead ends: 389 [2023-02-15 01:13:20,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=655, Invalid=4015, Unknown=22, NotChecked=0, Total=4692 [2023-02-15 01:13:20,707 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 674 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 107 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:13:20,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1053 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1493 Invalid, 34 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 01:13:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-02-15 01:13:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 278. [2023-02-15 01:13:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 266 states have (on average 1.2706766917293233) internal successors, (338), 277 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 338 transitions. [2023-02-15 01:13:20,710 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 338 transitions. Word has length 45 [2023-02-15 01:13:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:13:20,711 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 338 transitions. [2023-02-15 01:13:20,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.590909090909091) internal successors, (114), 45 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 338 transitions. [2023-02-15 01:13:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:13:20,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:13:20,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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-15 01:13:20,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 01:13:20,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 01:13:20,916 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:13:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:13:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1345334601, now seen corresponding path program 1 times [2023-02-15 01:13:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:13:20,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189666122] [2023-02-15 01:13:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:13:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:13:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:13:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:13:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189666122] [2023-02-15 01:13:21,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189666122] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:13:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503756628] [2023-02-15 01:13:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:13:21,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:13:21,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:13:21,618 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:13:21,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 01:13:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:13:21,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 01:13:21,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:13:21,852 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:13:21,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:13:21,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:13:21,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:13:22,014 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:13:22,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:13:22,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:13:22,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:22,052 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:13:22,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:13:22,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:13:22,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:13:22,091 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 01:13:22,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 01:13:22,131 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:13:22,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:13:22,142 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 01:13:22,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-02-15 01:13:22,290 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:13:22,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 61 [2023-02-15 01:13:22,304 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:13:22,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:13:22,343 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 01:13:22,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 71 [2023-02-15 01:13:22,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 01:13:22,507 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:13:22,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2023-02-15 01:13:22,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:13:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:22,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:13:22,644 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_1691 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-02-15 01:13:22,726 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1691 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_1692 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1692) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2023-02-15 01:13:22,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:22,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-02-15 01:13:22,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1691 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1687) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (+ 9 |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_prenex_27 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_26) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1692) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-02-15 01:13:22,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:22,857 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-15 01:13:23,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 01:13:23,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2023-02-15 01:13:23,266 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 142 treesize of output 126 [2023-02-15 01:13:23,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2023-02-15 01:13:23,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 01:13:23,376 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:13:23,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 01:13:23,392 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 7 treesize of output 3 [2023-02-15 01:13:23,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 01:13:23,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:13:23,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 01:13:23,407 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 7 treesize of output 3 [2023-02-15 01:13:23,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:23,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2023-02-15 01:13:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-15 01:13:24,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503756628] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:13:24,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:13:24,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2023-02-15 01:13:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425670925] [2023-02-15 01:13:24,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:13:24,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 01:13:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:13:24,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 01:13:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1830, Unknown=21, NotChecked=270, Total=2352 [2023-02-15 01:13:24,461 INFO L87 Difference]: Start difference. First operand 278 states and 338 transitions. Second operand has 49 states, 48 states have (on average 2.7291666666666665) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:13:27,677 INFO L93 Difference]: Finished difference Result 437 states and 520 transitions. [2023-02-15 01:13:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-15 01:13:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.7291666666666665) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-15 01:13:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:13:27,679 INFO L225 Difference]: With dead ends: 437 [2023-02-15 01:13:27,679 INFO L226 Difference]: Without dead ends: 437 [2023-02-15 01:13:27,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=877, Invalid=5434, Unknown=21, NotChecked=474, Total=6806 [2023-02-15 01:13:27,680 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 829 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 101 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 731 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:13:27,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1300 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1969 Invalid, 39 Unknown, 731 Unchecked, 1.3s Time] [2023-02-15 01:13:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-02-15 01:13:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 241. [2023-02-15 01:13:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 229 states have (on average 1.2838427947598254) internal successors, (294), 240 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 294 transitions. [2023-02-15 01:13:27,684 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 294 transitions. Word has length 45 [2023-02-15 01:13:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:13:27,684 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 294 transitions. [2023-02-15 01:13:27,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.7291666666666665) internal successors, (131), 49 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 294 transitions. [2023-02-15 01:13:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:13:27,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:13:27,685 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:13:27,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 01:13:27,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 01:13:27,899 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:13:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:13:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 992568690, now seen corresponding path program 1 times [2023-02-15 01:13:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:13:27,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603758561] [2023-02-15 01:13:27,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:13:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:13:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:13:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:13:28,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603758561] [2023-02-15 01:13:28,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603758561] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:13:28,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999815660] [2023-02-15 01:13:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:13:28,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:13:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:13:28,253 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:13:28,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 01:13:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:13:28,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 01:13:28,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:13:28,458 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:13:28,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:13:28,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:13:28,539 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:13:28,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:13:28,550 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:13:28,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:13:28,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:28,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2023-02-15 01:13:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:28,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:13:28,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1766 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2023-02-15 01:13:28,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:28,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-02-15 01:13:28,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:28,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-02-15 01:13:28,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:13:29,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:29,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2023-02-15 01:13:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2023-02-15 01:13:29,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999815660] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:13:29,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:13:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 15] total 36 [2023-02-15 01:13:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814868085] [2023-02-15 01:13:29,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:13:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 01:13:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:13:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 01:13:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1070, Unknown=19, NotChecked=68, Total=1332 [2023-02-15 01:13:29,142 INFO L87 Difference]: Start difference. First operand 241 states and 294 transitions. Second operand has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:13:29,820 INFO L93 Difference]: Finished difference Result 270 states and 324 transitions. [2023-02-15 01:13:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 01:13:29,821 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-15 01:13:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:13:29,822 INFO L225 Difference]: With dead ends: 270 [2023-02-15 01:13:29,822 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 01:13:29,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=501, Invalid=2240, Unknown=19, NotChecked=102, Total=2862 [2023-02-15 01:13:29,822 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 260 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:13:29,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 892 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1081 Invalid, 1 Unknown, 105 Unchecked, 0.4s Time] [2023-02-15 01:13:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 01:13:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2023-02-15 01:13:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 234 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 287 transitions. [2023-02-15 01:13:29,828 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 287 transitions. Word has length 46 [2023-02-15 01:13:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:13:29,828 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 287 transitions. [2023-02-15 01:13:29,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.2222222222222223) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 287 transitions. [2023-02-15 01:13:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:13:29,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:13:29,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:13:29,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 01:13:30,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 01:13:30,035 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:13:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:13:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1084740117, now seen corresponding path program 2 times [2023-02-15 01:13:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:13:30,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875097895] [2023-02-15 01:13:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:13:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:13:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:13:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:13:30,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875097895] [2023-02-15 01:13:30,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875097895] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:13:30,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321745085] [2023-02-15 01:13:30,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:13:30,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:13:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:13:30,423 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:13:30,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 01:13:30,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:13:30,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:13:30,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 01:13:30,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:13:30,693 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:13:30,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:13:30,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:13:30,855 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:13:30,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2023-02-15 01:13:30,900 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:13:30,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2023-02-15 01:13:30,915 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:13:30,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:13:30,972 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 01:13:30,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2023-02-15 01:13:31,122 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 01:13:31,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2023-02-15 01:13:31,126 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 16 treesize of output 8 [2023-02-15 01:13:31,212 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 01:13:31,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 96 [2023-02-15 01:13:31,255 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 22 treesize of output 14 [2023-02-15 01:13:31,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:31,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-02-15 01:13:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:13:31,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:13:31,576 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1884 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2023-02-15 01:13:31,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:31,831 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 01:13:32,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:32,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 01:13:32,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:32,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 90 [2023-02-15 01:13:32,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:32,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 69 [2023-02-15 01:13:32,089 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 54 treesize of output 46 [2023-02-15 01:13:32,096 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:13:32,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-15 01:13:32,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:13:32,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2023-02-15 01:13:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:13:32,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321745085] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:13:32,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:13:32,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 46 [2023-02-15 01:13:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283795730] [2023-02-15 01:13:32,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:13:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 01:13:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:13:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 01:13:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1793, Unknown=24, NotChecked=86, Total=2070 [2023-02-15 01:13:32,442 INFO L87 Difference]: Start difference. First operand 235 states and 287 transitions. Second operand has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:13:47,929 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 106 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:13:52,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse2 (select .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_146| Int) (v_ArrVal_1884 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int)) (let ((.cse1 (select v_arrayElimArr_27 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_146|)))) (or (not (= (select |c_#valid| .cse1) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_27) .cse1 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|))))) (forall ((v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|)))))) is different from false [2023-02-15 01:14:02,546 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 127 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:14:02,751 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1884 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_1884 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_27 (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (not (= (select |c_#valid| .cse0) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|))))) is different from false [2023-02-15 01:14:02,778 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1884 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_1884 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_27 (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)))) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|))))) is different from false [2023-02-15 01:14:04,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse2 (select .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (forall ((v_ArrVal_1884 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_146| Int) (v_ArrVal_1884 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int)) (let ((.cse1 (select v_arrayElimArr_27 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_146|)))) (or (not (= (select |c_#valid| .cse1) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_27) .cse1 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|)))) (forall ((v_ArrVal_1884 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_27 (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_arrayElimArr_27) .cse3 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (not (= (select |c_#valid| .cse3) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_44| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_44|) 0)) (forall ((v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |v_ULTIMATE.start_main_~t~0#1.base_44|)) |v_ULTIMATE.start_main_~t~0#1.base_44| v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|))))) (forall ((v_ArrVal_1884 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_144| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1884) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_144|)) 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_144| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_144|)))))) is different from false [2023-02-15 01:14:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:14:04,401 INFO L93 Difference]: Finished difference Result 787 states and 979 transitions. [2023-02-15 01:14:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-02-15 01:14:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-15 01:14:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:14:04,402 INFO L225 Difference]: With dead ends: 787 [2023-02-15 01:14:04,402 INFO L226 Difference]: Without dead ends: 783 [2023-02-15 01:14:04,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 146 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 6334 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=2628, Invalid=17596, Unknown=102, NotChecked=1430, Total=21756 [2023-02-15 01:14:04,405 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1491 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 398 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:14:04,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1434 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1994 Invalid, 39 Unknown, 273 Unchecked, 1.9s Time] [2023-02-15 01:14:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2023-02-15 01:14:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 313. [2023-02-15 01:14:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 301 states have (on average 1.3289036544850499) internal successors, (400), 312 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:14:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2023-02-15 01:14:04,415 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 46 [2023-02-15 01:14:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:14:04,415 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2023-02-15 01:14:04,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:14:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2023-02-15 01:14:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:14:04,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:14:04,416 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:14:04,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 01:14:04,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 01:14:04,623 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2023-02-15 01:14:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:14:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash 375777400, now seen corresponding path program 1 times [2023-02-15 01:14:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:14:04,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426743690] [2023-02-15 01:14:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:14:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:14:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:14:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:14:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:14:05,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426743690] [2023-02-15 01:14:05,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426743690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:14:05,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107464732] [2023-02-15 01:14:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:14:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:14:05,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:14:05,241 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:14:05,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 01:14:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:14:05,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 01:14:05,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:14:05,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:14:05,744 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:14:05,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2023-02-15 01:14:05,764 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:14:05,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2023-02-15 01:14:05,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:14:05,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2023-02-15 01:14:06,151 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1958 Int) (|v_ULTIMATE.start_main_~p~0#1.base_156| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156| 1))) (and (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156|)) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0) (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1958) |v_ULTIMATE.start_main_~p~0#1.base_156| 0))))) is different from true [2023-02-15 01:14:06,176 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1958 Int) (|ULTIMATE.start_main_~p~0#1.base| Int) (|v_ULTIMATE.start_main_~p~0#1.base_156| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156| 1))) (and (= |c_#valid| (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1958) |v_ULTIMATE.start_main_~p~0#1.base_156| 0) |ULTIMATE.start_main_~p~0#1.base| 0)) (= 0 (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_156|)) (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0)))) is different from true [2023-02-15 01:14:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-15 01:14:06,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:14:06,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1962 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-15 01:14:06,401 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1962 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1962) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-15 01:14:06,404 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1962 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1962) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-15 01:14:06,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:14:06,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 01:14:06,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:14:06,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2023-02-15 01:14:06,434 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 19 treesize of output 17 [2023-02-15 01:14:50,668 WARN L233 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:15:14,889 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:15:39,129 WARN L233 SmtUtils]: Spent 24.15s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)