./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0504.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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 12:56:31,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:56:31,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:56:31,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:56:31,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:56:31,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:56:31,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:56:31,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:56:31,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:56:31,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:56:31,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:56:31,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:56:31,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:56:31,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:56:31,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:56:31,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:56:31,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:56:31,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:56:31,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:56:31,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:56:31,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:56:31,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:56:31,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:56:31,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:56:31,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:56:31,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:56:31,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:56:31,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:56:31,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:56:31,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:56:31,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:56:31,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:56:31,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:56:31,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:56:31,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:56:31,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:56:31,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:56:31,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:56:31,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:56:31,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:56:31,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:56:31,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 12:56:31,631 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:56:31,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:56:31,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:56:31,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:56:31,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:56:31,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:56:31,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:56:31,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:56:31,633 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:56:31,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:56:31,633 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:56:31,633 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 12:56:31,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:56:31,634 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 12:56:31,635 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:56:31,635 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:56:31,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:56:31,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:56:31,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:56:31,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:56:31,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:56:31,636 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:56:31,637 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2023-02-15 12:56:31,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:56:31,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:56:31,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:56:31,843 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:56:31,844 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:56:31,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2023-02-15 12:56:32,802 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:56:33,021 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:56:33,021 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2023-02-15 12:56:33,030 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8a2ac46/7f002c743a7444faa98fa2d4b6bc2985/FLAG3f121a8fe [2023-02-15 12:56:33,039 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8a2ac46/7f002c743a7444faa98fa2d4b6bc2985 [2023-02-15 12:56:33,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:56:33,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:56:33,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:56:33,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:56:33,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:56:33,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f2568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33, skipping insertion in model container [2023-02-15 12:56:33,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:56:33,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:56:33,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:56:33,313 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:56:33,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:56:33,368 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:56:33,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33 WrapperNode [2023-02-15 12:56:33,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:56:33,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:56:33,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:56:33,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:56:33,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,403 INFO L138 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2023-02-15 12:56:33,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:56:33,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:56:33,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:56:33,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:56:33,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,426 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:56:33,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:56:33,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:56:33,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:56:33,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (1/1) ... [2023-02-15 12:56:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:56:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:33,449 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 12:56:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 12:56:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 12:56:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:56:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 12:56:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 12:56:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 12:56:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:56:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:56:33,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:56:33,458 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 12:56:33,543 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:56:33,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:56:33,748 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:56:33,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:56:33,752 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 12:56:33,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:33 BoogieIcfgContainer [2023-02-15 12:56:33,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:56:33,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:56:33,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:56:33,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:56:33,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:56:33" (1/3) ... [2023-02-15 12:56:33,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f65cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:56:33, skipping insertion in model container [2023-02-15 12:56:33,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:33" (2/3) ... [2023-02-15 12:56:33,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301f65cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:56:33, skipping insertion in model container [2023-02-15 12:56:33,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:33" (3/3) ... [2023-02-15 12:56:33,759 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0504.i [2023-02-15 12:56:33,770 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:56:33,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-15 12:56:33,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:56:33,801 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;@28f8ea3a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:56:33,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-15 12:56:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 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 12:56:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 12:56:33,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:33,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 12:56:33,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2023-02-15 12:56:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:33,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149304563] [2023-02-15 12:56:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:33,923 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 12:56:33,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:33,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149304563] [2023-02-15 12:56:33,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149304563] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:33,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:33,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:56:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689053973] [2023-02-15 12:56:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:33,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 12:56:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 12:56:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 12:56:33,954 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:33,980 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-02-15 12:56:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 12:56:33,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 12:56:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:33,987 INFO L225 Difference]: With dead ends: 87 [2023-02-15 12:56:33,987 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 12:56:33,989 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 12:56:33,992 INFO L413 NwaCegarLoop]: 91 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, 91 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 12:56:33,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 12:56:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 12:56:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 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 12:56:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2023-02-15 12:56:34,021 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2023-02-15 12:56:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,021 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2023-02-15 12:56:34,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2023-02-15 12:56:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 12:56:34,022 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:56:34,023 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2023-02-15 12:56:34,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239792904] [2023-02-15 12:56:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:34,136 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 12:56:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:34,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239792904] [2023-02-15 12:56:34,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239792904] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:34,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:34,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:56:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597747000] [2023-02-15 12:56:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:34,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:56:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:56:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,140 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:34,163 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2023-02-15 12:56:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:56:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 12:56:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:34,165 INFO L225 Difference]: With dead ends: 133 [2023-02-15 12:56:34,165 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 12:56:34,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,166 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:34,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 12:56:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2023-02-15 12:56:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 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 12:56:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2023-02-15 12:56:34,173 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2023-02-15 12:56:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,174 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2023-02-15 12:56:34,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2023-02-15 12:56:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 12:56:34,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:56:34,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2023-02-15 12:56:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237623490] [2023-02-15 12:56:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:34,223 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 12:56:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:34,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237623490] [2023-02-15 12:56:34,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237623490] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:34,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:34,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:56:34,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898058969] [2023-02-15 12:56:34,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:34,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:56:34,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:34,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:56:34,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,226 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:34,292 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2023-02-15 12:56:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:56:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 12:56:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:34,294 INFO L225 Difference]: With dead ends: 130 [2023-02-15 12:56:34,294 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 12:56:34,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,295 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:34,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 12:56:34,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2023-02-15 12:56:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 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 12:56:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2023-02-15 12:56:34,301 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2023-02-15 12:56:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,301 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2023-02-15 12:56:34,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2023-02-15 12:56:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 12:56:34,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 12:56:34,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2023-02-15 12:56:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882745475] [2023-02-15 12:56:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:34,362 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 12:56:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:34,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882745475] [2023-02-15 12:56:34,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882745475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:34,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:34,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:56:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534047761] [2023-02-15 12:56:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:34,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:56:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:56:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,365 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:34,424 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2023-02-15 12:56:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:56:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 12:56:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:34,425 INFO L225 Difference]: With dead ends: 138 [2023-02-15 12:56:34,425 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 12:56:34,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,426 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:34,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 12:56:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2023-02-15 12:56:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 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 12:56:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2023-02-15 12:56:34,432 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2023-02-15 12:56:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,432 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2023-02-15 12:56:34,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2023-02-15 12:56:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 12:56:34,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 12:56:34,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2023-02-15 12:56:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255115244] [2023-02-15 12:56:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:34,456 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 12:56:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:34,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255115244] [2023-02-15 12:56:34,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255115244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:34,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:34,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:56:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792580461] [2023-02-15 12:56:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:56:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:56:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,462 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:34,508 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2023-02-15 12:56:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:56:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 12:56:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:34,510 INFO L225 Difference]: With dead ends: 103 [2023-02-15 12:56:34,510 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 12:56:34,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,511 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:34,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 12:56:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-15 12:56:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 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 12:56:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2023-02-15 12:56:34,516 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2023-02-15 12:56:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,516 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2023-02-15 12:56:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2023-02-15 12:56:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 12:56:34,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 12:56:34,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2023-02-15 12:56:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462381269] [2023-02-15 12:56:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:34,688 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 12:56:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462381269] [2023-02-15 12:56:34,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462381269] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:34,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:34,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:56:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414124049] [2023-02-15 12:56:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:34,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:56:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:34,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:56:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:56:34,691 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 12:56:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:34,772 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2023-02-15 12:56:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:56:34,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 12:56:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:34,773 INFO L225 Difference]: With dead ends: 126 [2023-02-15 12:56:34,773 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 12:56:34,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:56:34,774 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 112 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:34,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 69 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:34,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 12:56:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2023-02-15 12:56:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 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 12:56:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-02-15 12:56:34,778 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2023-02-15 12:56:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,778 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-02-15 12:56:34,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 12:56:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-02-15 12:56:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 12:56:34,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 12:56:34,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2023-02-15 12:56:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108929469] [2023-02-15 12:56:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:34,855 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 12:56:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108929469] [2023-02-15 12:56:34,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108929469] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:34,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:34,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:56:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205857749] [2023-02-15 12:56:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:34,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:56:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:56:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,858 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:34,893 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2023-02-15 12:56:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:56:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 12:56:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:34,894 INFO L225 Difference]: With dead ends: 88 [2023-02-15 12:56:34,894 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 12:56:34,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:34,896 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:34,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 12:56:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 12:56:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 states have internal predecessors, (99), 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 12:56:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2023-02-15 12:56:34,913 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2023-02-15 12:56:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:34,913 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2023-02-15 12:56:34,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2023-02-15 12:56:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 12:56:34,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:34,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:34,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 12:56:34,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:34,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2023-02-15 12:56:34,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:34,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923584082] [2023-02-15 12:56:34,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:35,016 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 12:56:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923584082] [2023-02-15 12:56:35,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923584082] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:35,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:35,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:56:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145253022] [2023-02-15 12:56:35,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:35,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:56:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:56:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:35,018 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:35,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:35,047 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2023-02-15 12:56:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:56:35,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 12:56:35,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:35,048 INFO L225 Difference]: With dead ends: 84 [2023-02-15 12:56:35,048 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 12:56:35,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:56:35,050 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:35,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 12:56:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-15 12:56:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 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 12:56:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-02-15 12:56:35,056 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2023-02-15 12:56:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:35,057 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-02-15 12:56:35,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-02-15 12:56:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 12:56:35,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:35,062 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:35,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 12:56:35,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2023-02-15 12:56:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:35,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458374754] [2023-02-15 12:56:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:35,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458374754] [2023-02-15 12:56:35,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458374754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:35,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:35,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:56:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624096479] [2023-02-15 12:56:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:35,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:56:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:56:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:56:35,115 INFO L87 Difference]: Start difference. First operand 84 states and 91 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 12:56:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:35,198 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2023-02-15 12:56:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:56:35,199 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 12:56:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:35,199 INFO L225 Difference]: With dead ends: 114 [2023-02-15 12:56:35,199 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 12:56:35,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:56:35,200 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:35,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 12:56:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2023-02-15 12:56:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 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 12:56:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-02-15 12:56:35,202 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2023-02-15 12:56:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:35,202 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-02-15 12:56:35,202 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 12:56:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-02-15 12:56:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 12:56:35,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:35,202 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 12:56:35,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2023-02-15 12:56:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:35,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728394163] [2023-02-15 12:56:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:35,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728394163] [2023-02-15 12:56:35,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728394163] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:35,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:35,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:56:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330108453] [2023-02-15 12:56:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:35,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:56:35,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:56:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:56:35,285 INFO L87 Difference]: Start difference. First operand 86 states and 95 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 12:56:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:35,368 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2023-02-15 12:56:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 12:56:35,369 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 12:56:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:35,369 INFO L225 Difference]: With dead ends: 153 [2023-02-15 12:56:35,370 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 12:56:35,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:56:35,370 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:35,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 12:56:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2023-02-15 12:56:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 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 12:56:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2023-02-15 12:56:35,373 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2023-02-15 12:56:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:35,373 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2023-02-15 12:56:35,373 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 12:56:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2023-02-15 12:56:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 12:56:35,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:35,374 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:35,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 12:56:35,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2023-02-15 12:56:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289457192] [2023-02-15 12:56:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289457192] [2023-02-15 12:56:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289457192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:35,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:35,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:56:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325707712] [2023-02-15 12:56:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:35,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:56:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:56:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:56:35,407 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:35,446 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2023-02-15 12:56:35,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 12:56:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 12:56:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:35,447 INFO L225 Difference]: With dead ends: 113 [2023-02-15 12:56:35,447 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 12:56:35,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 12:56:35,448 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:35,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 12:56:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-02-15 12:56:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 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 12:56:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2023-02-15 12:56:35,450 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2023-02-15 12:56:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:35,450 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2023-02-15 12:56:35,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2023-02-15 12:56:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 12:56:35,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:35,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:35,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 12:56:35,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2023-02-15 12:56:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:35,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034296415] [2023-02-15 12:56:35,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:35,568 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 12:56:35,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:35,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034296415] [2023-02-15 12:56:35,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034296415] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:35,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:35,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 12:56:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521860227] [2023-02-15 12:56:35,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:35,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:56:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:35,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:56:35,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:56:35,570 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:35,677 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2023-02-15 12:56:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 12:56:35,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 12:56:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:35,678 INFO L225 Difference]: With dead ends: 170 [2023-02-15 12:56:35,678 INFO L226 Difference]: Without dead ends: 170 [2023-02-15 12:56:35,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:56:35,679 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:35,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 183 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-15 12:56:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2023-02-15 12:56:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 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 12:56:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2023-02-15 12:56:35,681 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2023-02-15 12:56:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:35,681 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2023-02-15 12:56:35,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2023-02-15 12:56:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 12:56:35,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:35,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:35,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 12:56:35,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:35,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2023-02-15 12:56:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:35,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126730987] [2023-02-15 12:56:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:35,974 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 12:56:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:35,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126730987] [2023-02-15 12:56:35,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126730987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:35,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:35,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:56:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205853996] [2023-02-15 12:56:35,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:35,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 12:56:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 12:56:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:56:35,976 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:36,232 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2023-02-15 12:56:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 12:56:36,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 12:56:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:36,233 INFO L225 Difference]: With dead ends: 184 [2023-02-15 12:56:36,233 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 12:56:36,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-02-15 12:56:36,234 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 173 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:36,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 195 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 12:56:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2023-02-15 12:56:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 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 12:56:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2023-02-15 12:56:36,236 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2023-02-15 12:56:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:36,236 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2023-02-15 12:56:36,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2023-02-15 12:56:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 12:56:36,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:36,236 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:36,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 12:56:36,237 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2023-02-15 12:56:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:36,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808961374] [2023-02-15 12:56:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 12:56:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:36,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808961374] [2023-02-15 12:56:36,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808961374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:36,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:36,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:56:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221972002] [2023-02-15 12:56:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:36,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:56:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:56:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:56:36,271 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:36,330 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2023-02-15 12:56:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:56:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 12:56:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:36,332 INFO L225 Difference]: With dead ends: 135 [2023-02-15 12:56:36,332 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 12:56:36,332 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 12:56:36,332 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:36,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 12:56:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2023-02-15 12:56:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 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 12:56:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2023-02-15 12:56:36,334 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2023-02-15 12:56:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:36,335 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2023-02-15 12:56:36,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2023-02-15 12:56:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 12:56:36,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:36,335 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:36,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 12:56:36,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2023-02-15 12:56:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:36,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24311267] [2023-02-15 12:56:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24311267] [2023-02-15 12:56:36,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24311267] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:36,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:36,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:56:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882932656] [2023-02-15 12:56:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:36,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:56:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:56:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:56:36,413 INFO L87 Difference]: Start difference. First operand 123 states and 139 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 12:56:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:36,550 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2023-02-15 12:56:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 12:56:36,551 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 12:56:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:36,551 INFO L225 Difference]: With dead ends: 194 [2023-02-15 12:56:36,551 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 12:56:36,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 12:56:36,552 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:36,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 12:56:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2023-02-15 12:56:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 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 12:56:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2023-02-15 12:56:36,554 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2023-02-15 12:56:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:36,554 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2023-02-15 12:56:36,554 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 12:56:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2023-02-15 12:56:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 12:56:36,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:36,555 INFO L195 NwaCegarLoop]: trace histogram [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 12:56:36,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 12:56:36,555 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2023-02-15 12:56:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:36,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933299786] [2023-02-15 12:56:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933299786] [2023-02-15 12:56:36,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933299786] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:36,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:36,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:56:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359046443] [2023-02-15 12:56:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:36,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:56:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:56:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:56:36,661 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 12:56:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:36,824 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2023-02-15 12:56:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 12:56:36,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 12:56:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:36,825 INFO L225 Difference]: With dead ends: 200 [2023-02-15 12:56:36,825 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 12:56:36,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:56:36,825 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 87 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:36,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 225 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 12:56:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2023-02-15 12:56:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.328125) internal successors, (170), 143 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 12:56:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2023-02-15 12:56:36,828 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 23 [2023-02-15 12:56:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:36,828 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2023-02-15 12:56:36,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 12:56:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2023-02-15 12:56:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 12:56:36,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:36,828 INFO L195 NwaCegarLoop]: trace histogram [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 12:56:36,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 12:56:36,828 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -316635568, now seen corresponding path program 1 times [2023-02-15 12:56:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:36,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170123705] [2023-02-15 12:56:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:36,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170123705] [2023-02-15 12:56:36,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170123705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:36,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:36,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:56:36,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738394550] [2023-02-15 12:56:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:36,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 12:56:36,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 12:56:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 12:56:36,997 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 12:56:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:37,143 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2023-02-15 12:56:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 12:56:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 12:56:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:37,144 INFO L225 Difference]: With dead ends: 195 [2023-02-15 12:56:37,144 INFO L226 Difference]: Without dead ends: 195 [2023-02-15 12:56:37,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 12:56:37,145 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:37,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 236 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-15 12:56:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2023-02-15 12:56:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 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 12:56:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2023-02-15 12:56:37,147 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2023-02-15 12:56:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:37,147 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2023-02-15 12:56:37,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 12:56:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2023-02-15 12:56:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 12:56:37,147 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:37,147 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:37,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 12:56:37,148 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2023-02-15 12:56:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:37,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877594206] [2023-02-15 12:56:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:37,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877594206] [2023-02-15 12:56:37,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877594206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:37,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:37,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:56:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984993400] [2023-02-15 12:56:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:37,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:56:37,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:37,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:56:37,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:56:37,194 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:37,280 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2023-02-15 12:56:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 12:56:37,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 12:56:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:37,281 INFO L225 Difference]: With dead ends: 167 [2023-02-15 12:56:37,281 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 12:56:37,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 12:56:37,281 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 113 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:37,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 148 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 12:56:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2023-02-15 12:56:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 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 12:56:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2023-02-15 12:56:37,283 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2023-02-15 12:56:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:37,283 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2023-02-15 12:56:37,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2023-02-15 12:56:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 12:56:37,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:37,284 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] [2023-02-15 12:56:37,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 12:56:37,284 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2023-02-15 12:56:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:37,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148508812] [2023-02-15 12:56:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:37,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148508812] [2023-02-15 12:56:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148508812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544948265] [2023-02-15 12:56:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:37,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:37,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:37,501 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 12:56:37,533 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 12:56:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:37,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 12:56:37,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:37,645 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 12:56:37,650 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 12:56:37,662 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 12:56:37,667 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 12:56:37,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:37,677 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 12:56:37,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:37,681 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 12:56:37,690 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 12:56:37,695 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 12:56:37,704 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 12:56:37,709 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 12:56:37,753 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 12:56:37,766 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 12:56:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:37,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544948265] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:37,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:37,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2023-02-15 12:56:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314155370] [2023-02-15 12:56:37,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:37,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 12:56:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 12:56:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:56:37,867 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 12:56:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:38,010 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2023-02-15 12:56:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 12:56:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 12:56:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:38,011 INFO L225 Difference]: With dead ends: 186 [2023-02-15 12:56:38,011 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 12:56:38,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-02-15 12:56:38,011 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 205 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:38,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 267 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 12:56:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2023-02-15 12:56:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 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 12:56:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2023-02-15 12:56:38,014 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2023-02-15 12:56:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:38,014 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2023-02-15 12:56:38,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 12:56:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2023-02-15 12:56:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 12:56:38,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:38,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 12:56:38,020 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 12:56:38,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:38,220 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2023-02-15 12:56:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:38,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984753698] [2023-02-15 12:56:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:38,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984753698] [2023-02-15 12:56:38,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984753698] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:38,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250424583] [2023-02-15 12:56:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:38,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:38,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:38,301 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 12:56:38,357 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 12:56:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:38,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 12:56:38,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:38,462 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 12:56:38,484 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 12:56:38,484 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 12:56:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:38,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:38,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250424583] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:38,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:38,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-15 12:56:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373770374] [2023-02-15 12:56:38,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 12:56:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 12:56:38,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 12:56:38,607 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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 12:56:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:38,702 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2023-02-15 12:56:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 12:56:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 12:56:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:38,703 INFO L225 Difference]: With dead ends: 181 [2023-02-15 12:56:38,703 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 12:56:38,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:56:38,703 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 118 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:38,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 12:56:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2023-02-15 12:56:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 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 12:56:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2023-02-15 12:56:38,706 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2023-02-15 12:56:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:38,708 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2023-02-15 12:56:38,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 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 12:56:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2023-02-15 12:56:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 12:56:38,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:38,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 12:56:38,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 12:56:38,913 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,SelfDestructingSolverStorable19 [2023-02-15 12:56:38,914 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2023-02-15 12:56:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:38,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445232113] [2023-02-15 12:56:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:38,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:39,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445232113] [2023-02-15 12:56:39,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445232113] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:39,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48478631] [2023-02-15 12:56:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:39,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:39,047 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 12:56:39,048 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 12:56:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:39,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 12:56:39,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:39,154 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 12:56:39,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:39,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12:56:39,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:56:39,215 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 12:56:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:39,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:39,414 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 50 treesize of output 46 [2023-02-15 12:56:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:39,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48478631] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:39,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:39,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-02-15 12:56:39,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602530050] [2023-02-15 12:56:39,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:39,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 12:56:39,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:39,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 12:56:39,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:56:39,454 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 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 12:56:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:39,587 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2023-02-15 12:56:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:56:39,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 12:56:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:39,588 INFO L225 Difference]: With dead ends: 180 [2023-02-15 12:56:39,588 INFO L226 Difference]: Without dead ends: 180 [2023-02-15 12:56:39,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-02-15 12:56:39,589 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 220 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:39,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 166 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-15 12:56:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2023-02-15 12:56:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 158 states have internal predecessors, (191), 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 12:56:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2023-02-15 12:56:39,591 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 27 [2023-02-15 12:56:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:39,591 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2023-02-15 12:56:39,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 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 12:56:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2023-02-15 12:56:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 12:56:39,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:39,591 INFO L195 NwaCegarLoop]: trace histogram [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 12:56:39,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 12:56:39,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:39,792 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2023-02-15 12:56:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:39,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984602716] [2023-02-15 12:56:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:39,853 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 12:56:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984602716] [2023-02-15 12:56:39,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984602716] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358186127] [2023-02-15 12:56:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:39,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:39,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:39,874 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 12:56:39,875 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 12:56:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:39,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 12:56:39,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:39,993 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 13 treesize of output 9 [2023-02-15 12:56:40,007 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 12:56:40,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:40,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_37| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_37| 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_37|) 0)))) is different from false [2023-02-15 12:56:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 12:56:40,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358186127] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:40,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:40,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2023-02-15 12:56:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47710619] [2023-02-15 12:56:40,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:40,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:56:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:56:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 12:56:40,041 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 12:56:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:40,191 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2023-02-15 12:56:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 12:56:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 28 [2023-02-15 12:56:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:40,192 INFO L225 Difference]: With dead ends: 161 [2023-02-15 12:56:40,192 INFO L226 Difference]: Without dead ends: 149 [2023-02-15 12:56:40,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=77, Unknown=1, NotChecked=18, Total=132 [2023-02-15 12:56:40,192 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:40,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 215 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2023-02-15 12:56:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-15 12:56:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-02-15 12:56:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 148 states have internal predecessors, (180), 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 12:56:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2023-02-15 12:56:40,194 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 28 [2023-02-15 12:56:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:40,195 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2023-02-15 12:56:40,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 12:56:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2023-02-15 12:56:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 12:56:40,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:40,195 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] [2023-02-15 12:56:40,202 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 12:56:40,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:40,400 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2023-02-15 12:56:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796332166] [2023-02-15 12:56:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:40,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796332166] [2023-02-15 12:56:40,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796332166] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:40,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162524832] [2023-02-15 12:56:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:40,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:40,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:40,755 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 12:56:40,769 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 12:56:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:40,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 12:56:40,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:40,910 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 12:56:40,932 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 12:56:40,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:40,941 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 12:56:40,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:40,952 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 12:56:40,969 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:56:40,970 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 12:56:40,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 12:56:41,004 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 18 [2023-02-15 12:56:41,037 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 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 12:56:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:41,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:41,213 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 50 treesize of output 46 [2023-02-15 12:56:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:41,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162524832] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:41,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 5] total 17 [2023-02-15 12:56:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283066079] [2023-02-15 12:56:41,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:41,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 12:56:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 12:56:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-02-15 12:56:41,252 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 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 12:56:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:41,661 INFO L93 Difference]: Finished difference Result 229 states and 267 transitions. [2023-02-15 12:56:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 12:56:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 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 31 [2023-02-15 12:56:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:41,662 INFO L225 Difference]: With dead ends: 229 [2023-02-15 12:56:41,662 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 12:56:41,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2023-02-15 12:56:41,663 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 245 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:41,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 315 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:56:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 12:56:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2023-02-15 12:56:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 165 states have internal predecessors, (199), 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 12:56:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2023-02-15 12:56:41,665 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 31 [2023-02-15 12:56:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:41,665 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2023-02-15 12:56:41,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 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 12:56:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2023-02-15 12:56:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 12:56:41,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:41,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:41,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 12:56:41,871 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,SelfDestructingSolverStorable22 [2023-02-15 12:56:41,871 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:41,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2023-02-15 12:56:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:41,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374648999] [2023-02-15 12:56:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:42,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374648999] [2023-02-15 12:56:42,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374648999] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:42,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931889459] [2023-02-15 12:56:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:42,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:42,064 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 12:56:42,065 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 12:56:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:42,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 12:56:42,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:42,185 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 12:56:42,196 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 12:56:42,209 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 12:56:42,209 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 21 treesize of output 29 [2023-02-15 12:56:42,249 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 12:56:42,250 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 33 treesize of output 24 [2023-02-15 12:56:42,272 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 12:56:42,272 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 16 [2023-02-15 12:56:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:42,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:42,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931889459] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:42,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:42,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-15 12:56:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55596239] [2023-02-15 12:56:42,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:42,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 12:56:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 12:56:42,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-15 12:56:42,362 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 12:56:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:42,580 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2023-02-15 12:56:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 12:56:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 12:56:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:42,581 INFO L225 Difference]: With dead ends: 184 [2023-02-15 12:56:42,581 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 12:56:42,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2023-02-15 12:56:42,581 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:42,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 319 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 12:56:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2023-02-15 12:56:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 164 states have internal predecessors, (197), 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 12:56:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2023-02-15 12:56:42,583 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 32 [2023-02-15 12:56:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:42,583 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2023-02-15 12:56:42,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 12:56:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2023-02-15 12:56:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 12:56:42,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:42,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:56:42,604 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 12:56:42,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:42,790 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2023-02-15 12:56:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:42,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825635249] [2023-02-15 12:56:42,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:43,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:43,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825635249] [2023-02-15 12:56:43,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825635249] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791489677] [2023-02-15 12:56:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:43,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:43,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:43,095 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 12:56:43,097 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 12:56:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:43,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 12:56:43,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:43,222 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 12:56:43,266 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 12:56:43,269 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 12:56:43,301 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 12:56:43,302 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 15 treesize of output 15 [2023-02-15 12:56:43,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12:56:43,361 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 12:56:43,362 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 38 treesize of output 29 [2023-02-15 12:56:43,374 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 12:56:43,374 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 39 treesize of output 30 [2023-02-15 12:56:43,417 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 12:56:43,418 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 22 [2023-02-15 12:56:43,423 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 12:56:43,423 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 37 treesize of output 17 [2023-02-15 12:56:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:43,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:51,704 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 50 treesize of output 46 [2023-02-15 12:56:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791489677] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:51,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:51,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-02-15 12:56:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266503940] [2023-02-15 12:56:51,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:51,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 12:56:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:51,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 12:56:51,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2023-02-15 12:56:51,798 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 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 12:56:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:52,491 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2023-02-15 12:56:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 12:56:52,491 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 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 12:56:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:52,492 INFO L225 Difference]: With dead ends: 239 [2023-02-15 12:56:52,492 INFO L226 Difference]: Without dead ends: 239 [2023-02-15 12:56:52,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 12:56:52,493 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 104 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:52,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 489 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 12:56:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-15 12:56:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 150. [2023-02-15 12:56:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 149 states have internal predecessors, (180), 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 12:56:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2023-02-15 12:56:52,495 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 32 [2023-02-15 12:56:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:52,495 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2023-02-15 12:56:52,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 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 12:56:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2023-02-15 12:56:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 12:56:52,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:52,496 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 12:56:52,502 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 12:56:52,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:52,701 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2023-02-15 12:56:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:52,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212031642] [2023-02-15 12:56:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:53,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212031642] [2023-02-15 12:56:53,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212031642] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:53,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913031605] [2023-02-15 12:56:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:53,011 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 12:56:53,013 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 12:56:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:53,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 12:56:53,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 12:56:53,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:56:53,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913031605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:53,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 12:56:53,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-02-15 12:56:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738816563] [2023-02-15 12:56:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:53,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:56:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:56:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-15 12:56:53,197 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 12:56:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:53,328 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2023-02-15 12:56:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:56:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 12:56:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:53,329 INFO L225 Difference]: With dead ends: 164 [2023-02-15 12:56:53,329 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 12:56:53,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-02-15 12:56:53,330 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:53,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 95 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 12:56:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2023-02-15 12:56:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 149 states have internal predecessors, (179), 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 12:56:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2023-02-15 12:56:53,337 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 33 [2023-02-15 12:56:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:53,337 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2023-02-15 12:56:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 12:56:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2023-02-15 12:56:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 12:56:53,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:53,338 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, 1] [2023-02-15 12:56:53,347 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 12:56:53,543 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,SelfDestructingSolverStorable25 [2023-02-15 12:56:53,543 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2023-02-15 12:56:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125723118] [2023-02-15 12:56:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 12:56:53,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:53,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125723118] [2023-02-15 12:56:53,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125723118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:53,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:53,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:56:53,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116137536] [2023-02-15 12:56:53,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:53,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:56:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:56:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:56:53,607 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 12:56:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:53,654 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2023-02-15 12:56:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:56:53,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 12:56:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:53,655 INFO L225 Difference]: With dead ends: 156 [2023-02-15 12:56:53,655 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 12:56:53,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 12:56:53,657 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:53,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:56:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 12:56:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2023-02-15 12:56:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.275229357798165) internal successors, (139), 120 states have internal predecessors, (139), 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 12:56:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2023-02-15 12:56:53,659 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 36 [2023-02-15 12:56:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:53,659 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2023-02-15 12:56:53,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 12:56:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2023-02-15 12:56:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 12:56:53,659 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:53,659 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, 1] [2023-02-15 12:56:53,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 12:56:53,660 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2023-02-15 12:56:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:53,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551018265] [2023-02-15 12:56:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:53,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:53,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:53,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551018265] [2023-02-15 12:56:53,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551018265] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:53,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:53,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:56:53,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506167764] [2023-02-15 12:56:53,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:56:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:56:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:56:53,766 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:53,928 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2023-02-15 12:56:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 12:56:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 12:56:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:53,929 INFO L225 Difference]: With dead ends: 155 [2023-02-15 12:56:53,929 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 12:56:53,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:56:53,929 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 71 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:53,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 171 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 12:56:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2023-02-15 12:56:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 129 states have internal predecessors, (151), 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 12:56:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2023-02-15 12:56:53,931 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 36 [2023-02-15 12:56:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:53,931 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2023-02-15 12:56:53,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2023-02-15 12:56:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 12:56:53,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:53,932 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, 1] [2023-02-15 12:56:53,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 12:56:53,932 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2023-02-15 12:56:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004796781] [2023-02-15 12:56:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:54,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004796781] [2023-02-15 12:56:54,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004796781] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:54,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:54,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:56:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498587394] [2023-02-15 12:56:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:54,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:56:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:56:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:56:54,128 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:54,340 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2023-02-15 12:56:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 12:56:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 12:56:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:54,341 INFO L225 Difference]: With dead ends: 206 [2023-02-15 12:56:54,341 INFO L226 Difference]: Without dead ends: 206 [2023-02-15 12:56:54,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:56:54,342 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 127 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:54,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 249 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-15 12:56:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 130. [2023-02-15 12:56:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.271186440677966) internal successors, (150), 129 states have internal predecessors, (150), 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 12:56:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2023-02-15 12:56:54,344 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 36 [2023-02-15 12:56:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:54,344 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2023-02-15 12:56:54,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 12:56:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2023-02-15 12:56:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 12:56:54,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:54,344 INFO L195 NwaCegarLoop]: trace histogram [3, 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 12:56:54,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 12:56:54,344 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2023-02-15 12:56:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:54,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852501261] [2023-02-15 12:56:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:54,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852501261] [2023-02-15 12:56:54,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852501261] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:54,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343896608] [2023-02-15 12:56:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:54,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:54,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:54,872 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 12:56:54,873 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 12:56:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:55,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 12:56:55,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:55,014 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 12:56:55,028 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 12:56:55,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:55,045 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 12:56:55,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:55,050 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 12:56:55,107 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:56:55,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 12:56:55,133 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 12:56:55,143 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 12:56:55,166 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 12:56:55,174 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 12:56:55,184 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 12:56:55,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:56:55,249 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 12:56:55,269 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 12:56:55,330 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 12:56:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:55,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:55,381 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-02-15 12:56:55,381 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 16 treesize of output 15 [2023-02-15 12:56:55,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2023-02-15 12:56:55,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:56:55,734 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 52 treesize of output 45 [2023-02-15 12:56:55,739 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 70 treesize of output 66 [2023-02-15 12:56:55,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:56:55,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-02-15 12:56:55,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:56:55,748 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 12:56:55,755 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 42 treesize of output 38 [2023-02-15 12:56:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:55,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343896608] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:55,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:55,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2023-02-15 12:56:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11762256] [2023-02-15 12:56:55,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:55,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 12:56:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 12:56:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=760, Unknown=13, NotChecked=56, Total=930 [2023-02-15 12:56:55,791 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 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 12:56:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:57,675 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2023-02-15 12:56:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 12:56:57,676 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 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 12:56:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:57,677 INFO L225 Difference]: With dead ends: 245 [2023-02-15 12:56:57,677 INFO L226 Difference]: Without dead ends: 245 [2023-02-15 12:56:57,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=514, Invalid=2752, Unknown=44, NotChecked=112, Total=3422 [2023-02-15 12:56:57,678 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 276 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 67 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:57,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 668 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1070 Invalid, 29 Unknown, 103 Unchecked, 0.8s Time] [2023-02-15 12:56:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-15 12:56:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 173. [2023-02-15 12:56:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.236024844720497) internal successors, (199), 172 states have internal predecessors, (199), 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 12:56:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2023-02-15 12:56:57,680 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 38 [2023-02-15 12:56:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:57,680 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2023-02-15 12:56:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 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 12:56:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2023-02-15 12:56:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 12:56:57,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:57,681 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, 1, 1, 1] [2023-02-15 12:56:57,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 12:56:57,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:57,887 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2023-02-15 12:56:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:57,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764228421] [2023-02-15 12:56:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:58,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764228421] [2023-02-15 12:56:58,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764228421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:58,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:58,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:56:58,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958623656] [2023-02-15 12:56:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:58,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 12:56:58,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 12:56:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:56:58,035 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 12:56:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:58,285 INFO L93 Difference]: Finished difference Result 288 states and 322 transitions. [2023-02-15 12:56:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 12:56:58,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 12:56:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:58,287 INFO L225 Difference]: With dead ends: 288 [2023-02-15 12:56:58,287 INFO L226 Difference]: Without dead ends: 288 [2023-02-15 12:56:58,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-02-15 12:56:58,287 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 289 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:58,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 417 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:56:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-02-15 12:56:58,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 175. [2023-02-15 12:56:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 174 states have internal predecessors, (201), 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 12:56:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2023-02-15 12:56:58,290 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 38 [2023-02-15 12:56:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:58,290 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2023-02-15 12:56:58,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 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 12:56:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2023-02-15 12:56:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 12:56:58,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:58,290 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, 1, 1, 1, 1] [2023-02-15 12:56:58,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 12:56:58,290 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2023-02-15 12:56:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:58,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513575754] [2023-02-15 12:56:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513575754] [2023-02-15 12:56:58,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513575754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:58,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:56:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815487796] [2023-02-15 12:56:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:58,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 12:56:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 12:56:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:56:58,418 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 12:56:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:58,642 INFO L93 Difference]: Finished difference Result 287 states and 321 transitions. [2023-02-15 12:56:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 12:56:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 39 [2023-02-15 12:56:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:58,643 INFO L225 Difference]: With dead ends: 287 [2023-02-15 12:56:58,643 INFO L226 Difference]: Without dead ends: 287 [2023-02-15 12:56:58,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-02-15 12:56:58,644 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 194 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:58,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 347 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:56:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-15 12:56:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 176. [2023-02-15 12:56:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 175 states have internal predecessors, (202), 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 12:56:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2023-02-15 12:56:58,646 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 39 [2023-02-15 12:56:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:58,647 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2023-02-15 12:56:58,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 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 12:56:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2023-02-15 12:56:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 12:56:58,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:58,647 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] [2023-02-15 12:56:58,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-15 12:56:58,648 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2023-02-15 12:56:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:58,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811111618] [2023-02-15 12:56:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:58,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:58,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811111618] [2023-02-15 12:56:58,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811111618] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:56:58,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502853339] [2023-02-15 12:56:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:58,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:56:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:56:58,789 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 12:56:58,810 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 12:56:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:58,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 12:56:58,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:56:58,964 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 12:56:58,996 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:56:58,998 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 12:56:59,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:56:59,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:56:59,083 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 16 treesize of output 16 [2023-02-15 12:56:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:59,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:56:59,180 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 11 treesize of output 9 [2023-02-15 12:56:59,182 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 12:56:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:56:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502853339] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:56:59,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:56:59,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-15 12:56:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068690952] [2023-02-15 12:56:59,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:56:59,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 12:56:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:59,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 12:56:59,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-02-15 12:56:59,265 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 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 12:56:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:56:59,738 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2023-02-15 12:56:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 12:56:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 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 40 [2023-02-15 12:56:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:56:59,739 INFO L225 Difference]: With dead ends: 269 [2023-02-15 12:56:59,739 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 12:56:59,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2023-02-15 12:56:59,740 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 313 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:56:59,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 543 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 12:56:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 12:56:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2023-02-15 12:56:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.225609756097561) internal successors, (201), 175 states have internal predecessors, (201), 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 12:56:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2023-02-15 12:56:59,745 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 40 [2023-02-15 12:56:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:56:59,745 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2023-02-15 12:56:59,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 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 12:56:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2023-02-15 12:56:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 12:56:59,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:56:59,746 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, 1, 1, 1, 1, 1] [2023-02-15 12:56:59,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 12:56:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-02-15 12:56:59,946 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:56:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:56:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2023-02-15 12:56:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:56:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183610332] [2023-02-15 12:56:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:56:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:56:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:56:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 12:56:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:56:59,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183610332] [2023-02-15 12:56:59,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183610332] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:56:59,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:56:59,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:56:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757177952] [2023-02-15 12:56:59,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:56:59,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:56:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:56:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:56:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:56:59,986 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 12:57:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:57:00,031 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2023-02-15 12:57:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:57:00,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 40 [2023-02-15 12:57:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:57:00,032 INFO L225 Difference]: With dead ends: 175 [2023-02-15 12:57:00,032 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 12:57:00,032 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 12:57:00,033 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:57:00,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 12:57:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 12:57:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-15 12:57:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 174 states have internal predecessors, (199), 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 12:57:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2023-02-15 12:57:00,035 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 40 [2023-02-15 12:57:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:57:00,035 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2023-02-15 12:57:00,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 12:57:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2023-02-15 12:57:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 12:57:00,036 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:57:00,036 INFO L195 NwaCegarLoop]: trace histogram [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 12:57:00,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-15 12:57:00,036 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:57:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:57:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2023-02-15 12:57:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:57:00,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899995601] [2023-02-15 12:57:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:57:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:57:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899995601] [2023-02-15 12:57:00,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899995601] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:57:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317927428] [2023-02-15 12:57:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:00,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:57:00,317 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 12:57:00,342 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 12:57:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:00,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 12:57:00,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:57:00,495 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 12:57:00,551 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 12:57:00,552 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 12:57:00,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:57:00,699 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:57:00,699 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 12:57:00,755 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 12:57:00,791 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 12:57:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:00,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:57:00,859 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2271 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) |c_ULTIMATE.start_main_~first~0#1.base|))) (forall ((v_ArrVal_2271 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)) 1)))) is different from false [2023-02-15 12:57:00,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:00,862 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 23 treesize of output 24 [2023-02-15 12:57:00,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:00,866 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 38 [2023-02-15 12:57:00,869 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 12:57:00,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:00,878 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 24 treesize of output 25 [2023-02-15 12:57:00,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:57:00,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:00,881 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 22 treesize of output 10 [2023-02-15 12:57:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:01,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317927428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:57:01,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:57:01,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2023-02-15 12:57:01,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142797546] [2023-02-15 12:57:01,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:57:01,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 12:57:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:57:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 12:57:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=465, Unknown=1, NotChecked=44, Total=600 [2023-02-15 12:57:01,008 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 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 12:57:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:57:01,517 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2023-02-15 12:57:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 12:57:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 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 42 [2023-02-15 12:57:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:57:01,518 INFO L225 Difference]: With dead ends: 251 [2023-02-15 12:57:01,518 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 12:57:01,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=964, Unknown=1, NotChecked=66, Total=1260 [2023-02-15 12:57:01,519 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 339 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 12:57:01,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 450 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 738 Invalid, 0 Unknown, 132 Unchecked, 0.3s Time] [2023-02-15 12:57:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 12:57:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 222. [2023-02-15 12:57:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 211 states have (on average 1.2037914691943128) internal successors, (254), 221 states have internal predecessors, (254), 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 12:57:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 254 transitions. [2023-02-15 12:57:01,522 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 254 transitions. Word has length 42 [2023-02-15 12:57:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:57:01,522 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 254 transitions. [2023-02-15 12:57:01,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 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 12:57:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 254 transitions. [2023-02-15 12:57:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 12:57:01,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:57:01,522 INFO L195 NwaCegarLoop]: trace histogram [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 12:57:01,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 12:57:01,740 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,SelfDestructingSolverStorable34 [2023-02-15 12:57:01,740 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:57:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:57:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2023-02-15 12:57:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:57:01,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087155898] [2023-02-15 12:57:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:57:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:57:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087155898] [2023-02-15 12:57:02,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087155898] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:57:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238389996] [2023-02-15 12:57:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:02,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:57:02,313 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 12:57:02,315 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 12:57:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:02,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 12:57:02,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:57:02,485 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 12:57:02,533 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:57:02,533 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 12:57:02,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:57:02,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:57:02,667 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:57:02,667 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 12:57:02,671 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 12:57:02,710 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 12:57:02,714 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 12:57:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:02,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:57:02,828 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_ArrVal_2432 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 12))) (forall ((v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2433) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2023-02-15 12:57:02,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:02,832 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 12:57:02,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:02,837 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 12:57:02,847 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 12:57:02,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:02,852 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 12:57:02,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:02,857 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 12:57:02,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:57:02,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:02,860 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 12:57:02,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:57:02,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:02,864 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 12:57:02,934 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 12:57:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:03,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238389996] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:57:03,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:57:03,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2023-02-15 12:57:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316788198] [2023-02-15 12:57:03,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:57:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 12:57:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:57:03,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 12:57:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=516, Unknown=1, NotChecked=46, Total=650 [2023-02-15 12:57:03,025 INFO L87 Difference]: Start difference. First operand 222 states and 254 transitions. Second operand has 26 states, 25 states have (on average 4.44) internal successors, (111), 26 states have internal predecessors, (111), 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 12:57:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:57:06,218 INFO L93 Difference]: Finished difference Result 339 states and 383 transitions. [2023-02-15 12:57:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 12:57:06,218 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.44) internal successors, (111), 26 states have internal predecessors, (111), 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 42 [2023-02-15 12:57:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:57:06,219 INFO L225 Difference]: With dead ends: 339 [2023-02-15 12:57:06,220 INFO L226 Difference]: Without dead ends: 339 [2023-02-15 12:57:06,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=328, Invalid=1395, Unknown=3, NotChecked=80, Total=1806 [2023-02-15 12:57:06,220 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 297 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 12:57:06,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 784 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 934 Invalid, 1 Unknown, 188 Unchecked, 0.4s Time] [2023-02-15 12:57:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-15 12:57:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 231. [2023-02-15 12:57:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 220 states have (on average 1.2227272727272727) internal successors, (269), 230 states have internal predecessors, (269), 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 12:57:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2023-02-15 12:57:06,224 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 42 [2023-02-15 12:57:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:57:06,224 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2023-02-15 12:57:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.44) internal successors, (111), 26 states have internal predecessors, (111), 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 12:57:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2023-02-15 12:57:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 12:57:06,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:57:06,224 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] [2023-02-15 12:57:06,231 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 12:57:06,431 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,SelfDestructingSolverStorable35 [2023-02-15 12:57:06,431 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:57:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:57:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2023-02-15 12:57:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:57:06,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631818115] [2023-02-15 12:57:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:57:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:57:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631818115] [2023-02-15 12:57:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631818115] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:57:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108940453] [2023-02-15 12:57:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:06,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:06,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:57:06,993 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 12:57:07,053 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 12:57:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:07,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 12:57:07,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:57:07,232 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 12:57:07,235 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 12:57:07,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:07,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 21 treesize of output 20 [2023-02-15 12:57:07,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:07,262 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 12:57:07,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:07,285 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 12:57:07,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:07,289 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 12:57:07,402 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 12:57:07,402 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 23 treesize of output 18 [2023-02-15 12:57:07,426 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 12:57:07,426 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 23 treesize of output 18 [2023-02-15 12:57:07,542 INFO L321 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2023-02-15 12:57:07,542 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 39 treesize of output 48 [2023-02-15 12:57:07,563 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-15 12:57:07,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2023-02-15 12:57:07,570 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 5 [2023-02-15 12:57:07,581 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 12:57:07,587 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 5 [2023-02-15 12:57:07,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-02-15 12:57:07,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:07,650 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 32 [2023-02-15 12:57:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:07,655 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 32 [2023-02-15 12:57:07,667 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 31 treesize of output 30 [2023-02-15 12:57:07,671 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 31 treesize of output 30 [2023-02-15 12:57:07,717 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 12:57:07,717 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 34 [2023-02-15 12:57:07,729 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 12:57:07,730 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 40 [2023-02-15 12:57:07,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:08,025 INFO L321 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-02-15 12:57:08,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2023-02-15 12:57:08,044 INFO L321 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-02-15 12:57:08,044 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 30 treesize of output 34 [2023-02-15 12:57:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:08,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:57:08,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 12:57:08,860 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (forall ((v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2581))) (store .cse1 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_2585) .cse3 v_ArrVal_2587))))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2583 Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2580))) (store .cse4 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_2583) .cse3 v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))))) is different from false [2023-02-15 12:57:08,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (forall ((v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2581))) (store .cse1 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_2585) .cse3 v_ArrVal_2587))))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2583 Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (or (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2580))) (store .cse5 |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~y~0#1.base|) .cse2 v_ArrVal_2583) .cse3 v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)))))) is different from false [2023-02-15 12:57:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:10,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108940453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:57:10,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:57:10,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 52 [2023-02-15 12:57:10,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152489311] [2023-02-15 12:57:10,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:57:10,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 12:57:10,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:57:10,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 12:57:10,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2084, Unknown=174, NotChecked=194, Total=2652 [2023-02-15 12:57:10,646 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 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 12:57:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:57:14,692 INFO L93 Difference]: Finished difference Result 495 states and 589 transitions. [2023-02-15 12:57:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-15 12:57:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 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 42 [2023-02-15 12:57:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:57:14,694 INFO L225 Difference]: With dead ends: 495 [2023-02-15 12:57:14,694 INFO L226 Difference]: Without dead ends: 495 [2023-02-15 12:57:14,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=873, Invalid=7247, Unknown=260, NotChecked=362, Total=8742 [2023-02-15 12:57:14,696 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 526 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:57:14,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1393 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2191 Invalid, 0 Unknown, 240 Unchecked, 1.2s Time] [2023-02-15 12:57:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-02-15 12:57:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 259. [2023-02-15 12:57:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 248 states have (on average 1.2056451612903225) internal successors, (299), 258 states have internal predecessors, (299), 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 12:57:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2023-02-15 12:57:14,700 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 42 [2023-02-15 12:57:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:57:14,700 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2023-02-15 12:57:14,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 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 12:57:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2023-02-15 12:57:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 12:57:14,701 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:57:14,701 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2023-02-15 12:57:14,718 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 12:57:14,916 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,SelfDestructingSolverStorable36 [2023-02-15 12:57:14,916 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:57:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:57:14,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2023-02-15 12:57:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:57:14,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045996531] [2023-02-15 12:57:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:57:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:15,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:57:15,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045996531] [2023-02-15 12:57:15,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045996531] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:57:15,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057168698] [2023-02-15 12:57:15,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:57:15,225 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 12:57:15,229 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 12:57:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:15,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 12:57:15,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:57:15,435 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 12:57:15,479 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:57:15,479 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 12:57:15,552 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 11 treesize of output 7 [2023-02-15 12:57:15,572 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:57:15,572 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 12:57:15,602 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 24 treesize of output 12 [2023-02-15 12:57:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:15,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:57:15,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:15,679 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 23 treesize of output 24 [2023-02-15 12:57:15,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:15,686 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 38 [2023-02-15 12:57:15,689 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 12:57:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:15,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057168698] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:57:15,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:57:15,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2023-02-15 12:57:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786985082] [2023-02-15 12:57:15,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:57:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 12:57:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:57:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 12:57:15,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=223, Unknown=3, NotChecked=0, Total=272 [2023-02-15 12:57:15,844 INFO L87 Difference]: Start difference. First operand 259 states and 299 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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 12:57:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:57:16,155 INFO L93 Difference]: Finished difference Result 292 states and 323 transitions. [2023-02-15 12:57:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 12:57:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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 12:57:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:57:16,156 INFO L225 Difference]: With dead ends: 292 [2023-02-15 12:57:16,156 INFO L226 Difference]: Without dead ends: 292 [2023-02-15 12:57:16,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=495, Unknown=3, NotChecked=0, Total=650 [2023-02-15 12:57:16,157 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 410 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:57:16,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 301 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:57:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-15 12:57:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2023-02-15 12:57:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 248 states have (on average 1.1975806451612903) internal successors, (297), 258 states have internal predecessors, (297), 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 12:57:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 297 transitions. [2023-02-15 12:57:16,172 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 297 transitions. Word has length 43 [2023-02-15 12:57:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:57:16,172 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 297 transitions. [2023-02-15 12:57:16,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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 12:57:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 297 transitions. [2023-02-15 12:57:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 12:57:16,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:57:16,175 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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 12:57:16,188 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 12:57:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:16,380 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:57:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:57:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2023-02-15 12:57:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:57:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643704610] [2023-02-15 12:57:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:57:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:57:16,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643704610] [2023-02-15 12:57:16,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643704610] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:57:16,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582551599] [2023-02-15 12:57:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:16,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:16,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:57:16,822 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 12:57:16,823 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 12:57:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:17,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-15 12:57:17,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:57:17,027 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 12:57:17,034 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 12:57:17,054 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 12:57:17,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:17,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:17,081 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 30 treesize of output 32 [2023-02-15 12:57:17,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 32 treesize of output 34 [2023-02-15 12:57:17,103 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 32 treesize of output 34 [2023-02-15 12:57:17,177 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:57:17,177 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 12:57:17,206 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 21 [2023-02-15 12:57:17,223 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 21 [2023-02-15 12:57:17,239 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 21 [2023-02-15 12:57:17,248 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 21 [2023-02-15 12:57:17,259 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 21 [2023-02-15 12:57:17,304 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 12:57:17,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 12:57:17,343 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 21 [2023-02-15 12:57:17,375 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 7 treesize of output 3 [2023-02-15 12:57:17,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:17,377 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 22 treesize of output 10 [2023-02-15 12:57:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:17,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:57:17,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:17,459 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 20 treesize of output 24 [2023-02-15 12:57:17,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_50| Int) (v_ArrVal_2920 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2911 Int)) (or (<= 0 (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2911)) |v_ULTIMATE.start_main_~x~0#1.base_50| v_ArrVal_2920))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) 0))) |v_ULTIMATE.start_main_~x~0#1.base_50| v_ArrVal_2923) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_50|) 0)))) is different from false [2023-02-15 12:57:17,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:17,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2023-02-15 12:57:17,909 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 80 treesize of output 76 [2023-02-15 12:57:17,913 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 47 treesize of output 39 [2023-02-15 12:57:17,915 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 37 treesize of output 33 [2023-02-15 12:57:17,917 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 55 treesize of output 47 [2023-02-15 12:57:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 12:57:17,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582551599] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:57:17,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:57:17,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2023-02-15 12:57:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670050705] [2023-02-15 12:57:17,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:57:17,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 12:57:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:57:17,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 12:57:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=855, Unknown=9, NotChecked=60, Total=1056 [2023-02-15 12:57:17,947 INFO L87 Difference]: Start difference. First operand 259 states and 297 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 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 12:57:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:57:20,675 INFO L93 Difference]: Finished difference Result 437 states and 488 transitions. [2023-02-15 12:57:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-15 12:57:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 12:57:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:57:20,676 INFO L225 Difference]: With dead ends: 437 [2023-02-15 12:57:20,676 INFO L226 Difference]: Without dead ends: 437 [2023-02-15 12:57:20,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1164, Invalid=4990, Unknown=12, NotChecked=154, Total=6320 [2023-02-15 12:57:20,678 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 572 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 129 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 12:57:20,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 695 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1316 Invalid, 2 Unknown, 226 Unchecked, 0.9s Time] [2023-02-15 12:57:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-02-15 12:57:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 306. [2023-02-15 12:57:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 295 states have (on average 1.230508474576271) internal successors, (363), 305 states have internal predecessors, (363), 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 12:57:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 363 transitions. [2023-02-15 12:57:20,689 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 363 transitions. Word has length 44 [2023-02-15 12:57:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:57:20,689 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 363 transitions. [2023-02-15 12:57:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 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 12:57:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 363 transitions. [2023-02-15 12:57:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 12:57:20,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:57:20,693 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, 1, 1, 1] [2023-02-15 12:57:20,698 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 12:57:20,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-02-15 12:57:20,894 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 12:57:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:57:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2023-02-15 12:57:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:57:20,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326501509] [2023-02-15 12:57:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:57:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:57:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326501509] [2023-02-15 12:57:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326501509] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:57:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281590901] [2023-02-15 12:57:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:57:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:57:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:57:21,887 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 12:57:21,894 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 12:57:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:57:22,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-15 12:57:22,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:57:22,130 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 12:57:22,134 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 12:57:22,141 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 12:57:22,146 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 12:57:22,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,154 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 12:57:22,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,161 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 12:57:22,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:22,203 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 12:57:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,213 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 30 treesize of output 32 [2023-02-15 12:57:22,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:22,225 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 12:57:22,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,234 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 30 treesize of output 32 [2023-02-15 12:57:22,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,358 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2023-02-15 12:57:22,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2023-02-15 12:57:22,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,406 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-02-15 12:57:22,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2023-02-15 12:57:22,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,679 INFO L321 Elim1Store]: treesize reduction 132, result has 31.6 percent of original size [2023-02-15 12:57:22,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 159 [2023-02-15 12:57:22,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:22,735 INFO L321 Elim1Store]: treesize reduction 136, result has 29.5 percent of original size [2023-02-15 12:57:22,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 118 treesize of output 126 [2023-02-15 12:57:23,810 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-15 12:57:23,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 200 [2023-02-15 12:57:23,827 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-15 12:57:23,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 174 [2023-02-15 12:57:23,873 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 13 treesize of output 9 [2023-02-15 12:57:23,881 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:23,885 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:23,889 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 5 [2023-02-15 12:57:23,947 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 13 treesize of output 9 [2023-02-15 12:57:23,956 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 12:57:23,962 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:23,965 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:23,971 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 13 treesize of output 9 [2023-02-15 12:57:23,981 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 12:57:24,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:24,051 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 12:57:24,054 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 12:57:24,058 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 17 treesize of output 9 [2023-02-15 12:57:24,064 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,067 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,069 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,071 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:24,131 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 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 12:57:24,132 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,133 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,135 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,189 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 12:57:24,189 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 36 [2023-02-15 12:57:24,200 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 12:57:24,201 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 28 treesize of output 34 [2023-02-15 12:57:24,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,217 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 12:57:24,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:24,225 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 35 treesize of output 34 [2023-02-15 12:57:24,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:57:24,228 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 39 treesize of output 38 [2023-02-15 12:57:24,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:24,373 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 38 treesize of output 38 [2023-02-15 12:57:24,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:57:24,380 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 26 [2023-02-15 12:57:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:57:24,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:57:27,285 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| 4))) (and (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (or (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse2 .cse3 v_ArrVal_3082)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse4 .cse3 v_ArrVal_3083)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))) (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (or (forall ((v_ArrVal_3086 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse4 .cse3 v_ArrVal_3083)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|)) (= (select .cse5 .cse1) 0)))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (not (= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| (store .cse2 .cse3 v_ArrVal_3082)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) is different from false [2023-02-15 12:57:41,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((v_ArrVal_3078 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)) (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse3 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (not (= (select (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078)))) (store .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse3 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))))) (not (<= v_ArrVal_3078 |c_ULTIMATE.start_main_#t~mem7#1.offset|)))) (forall ((v_ArrVal_3078 Int)) (or (not (<= v_ArrVal_3078 |c_ULTIMATE.start_main_#t~mem7#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (or (forall ((v_ArrVal_3083 Int) (v_ArrVal_3082 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (or (forall ((v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3090 Int)) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078)))) (store .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse5 .cse1) 0) (not (= (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0))))) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (forall ((v_ArrVal_3086 (Array Int Int))) (= (select (store (select (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0))))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)))))))) is different from false [2023-02-15 12:57:55,876 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse4 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse11 .cse8 v_ArrVal_3075)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4))))) (store .cse9 .cse4 (store (select .cse9 .cse4) .cse5 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select .cse0 .cse1) 0) (< .cse2 v_ArrVal_3078) (not (= (select (store (select (store (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse8 v_ArrVal_3073)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)))))) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse15 (select (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 .cse8 v_ArrVal_3073)))) (store .cse17 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse16 .cse4 (store (select .cse16 .cse4) .cse13 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store (select (store (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse11 .cse8 v_ArrVal_3075)))) (store .cse14 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse14 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4))))) (store .cse12 .cse4 (store (select .cse12 .cse4) .cse13 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (< .cse2 v_ArrVal_3078) (not (= (select (store .cse15 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (= (select .cse15 .cse1) 0) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078))))))))) is different from false [2023-02-15 12:57:56,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse9 (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse12 .cse6 v_ArrVal_3071) .cse7 v_ArrVal_3075)))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse2))))) (store .cse10 .cse2 (store (select .cse10 .cse2) .cse3 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (= (select (store (select (store (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse5 .cse6 v_ArrVal_3070) .cse7 v_ArrVal_3073)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= 0 (select .cse0 .cse8)) (< .cse9 v_ArrVal_3078) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)))))) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse16 (select (store (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse5 .cse6 v_ArrVal_3070) .cse7 v_ArrVal_3073)))) (store .cse18 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse18 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse17 .cse2 (store (select .cse17 .cse2) .cse14 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select (store (select (store (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse12 .cse6 v_ArrVal_3071) .cse7 v_ArrVal_3075)))) (store .cse15 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse15 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse2))))) (store .cse13 .cse2 (store (select .cse13 .cse2) .cse14 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (= (select (store .cse16 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (= (select .cse16 .cse8) 0) (< .cse9 v_ArrVal_3078) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078))))))))) is different from false [2023-02-15 12:58:01,000 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_3062 Int) (v_ArrVal_3066 Int) (v_ArrVal_3063 Int)) (or (not (<= v_ArrVal_3066 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse0 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse11 .cse6 v_ArrVal_3063) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3066) .cse7 v_ArrVal_3070) .cse8 v_ArrVal_3073)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store (select (store (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3062) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3071) .cse8 v_ArrVal_3075)))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)) (< v_ArrVal_3066 v_ArrVal_3078))))))) (forall ((v_ArrVal_3062 Int) (v_ArrVal_3066 Int) (v_ArrVal_3063 Int)) (or (forall ((|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3078 Int) (v_ArrVal_3075 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_20| Int) (v_ArrVal_3083 Int) (v_ArrVal_3073 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3086 (Array Int Int)) (v_ArrVal_3070 Int) (v_ArrVal_3087 (Array Int Int)) (v_ArrVal_3071 Int) (v_ArrVal_3082 Int) (v_ArrVal_3090 Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_20| 4))) (let ((.cse12 (select (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse5 .cse6 v_ArrVal_3062) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3071) .cse8 v_ArrVal_3075)))) (store .cse17 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse16 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3083))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3086) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (= (select .cse12 .cse1) 0) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse12 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store (select (store (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store .cse11 .cse6 v_ArrVal_3063) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3066) .cse7 v_ArrVal_3070) .cse8 v_ArrVal_3073)))) (store .cse15 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse15 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3078))))) (store .cse13 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3082))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3087) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3090) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_20| v_ArrVal_3078)) (< v_ArrVal_3066 v_ArrVal_3078))))) (not (<= v_ArrVal_3066 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-02-15 12:58:01,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:58:01,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:01,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:01,185 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:01,236 INFO L217 Elim1Store]: Index analysis took 160 ms [2023-02-15 12:58:01,772 INFO L321 Elim1Store]: treesize reduction 128, result has 47.8 percent of original size [2023-02-15 12:58:01,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 131 [2023-02-15 12:58:01,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:01,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:01,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:01,942 INFO L321 Elim1Store]: treesize reduction 175, result has 40.3 percent of original size [2023-02-15 12:58:01,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 302 treesize of output 143 [2023-02-15 12:58:01,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:58:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:58:01,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:01,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 132 [2023-02-15 12:58:02,014 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:58:02,014 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 160 treesize of output 148 [2023-02-15 12:58:02,143 INFO L321 Elim1Store]: treesize reduction 8, result has 92.4 percent of original size [2023-02-15 12:58:02,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 131 treesize of output 201 [2023-02-15 12:58:02,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:02,169 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 34 treesize of output 38 [2023-02-15 12:58:02,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:02,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 12:58:02,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:02,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:02,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:02,524 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:58:02,557 INFO L321 Elim1Store]: treesize reduction 106, result has 0.9 percent of original size [2023-02-15 12:58:02,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 303 treesize of output 1 [2023-02-15 12:58:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:02,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281590901] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:58:02,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:58:02,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 51 [2023-02-15 12:58:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56840193] [2023-02-15 12:58:02,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:58:02,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 12:58:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 12:58:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1750, Unknown=126, NotChecked=460, Total=2550 [2023-02-15 12:58:02,563 INFO L87 Difference]: Start difference. First operand 306 states and 363 transitions. Second operand has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 51 states have internal predecessors, (112), 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 12:58:41,274 WARN L233 SmtUtils]: Spent 28.09s on a formula simplification. DAG size of input: 101 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 12:59:34,881 WARN L233 SmtUtils]: Spent 38.19s on a formula simplification. DAG size of input: 122 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:00:25,223 WARN L233 SmtUtils]: Spent 28.18s on a formula simplification. DAG size of input: 111 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:00:54,145 WARN L233 SmtUtils]: Spent 28.09s on a formula simplification. DAG size of input: 97 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:00:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:00:54,616 INFO L93 Difference]: Finished difference Result 458 states and 544 transitions. [2023-02-15 13:00:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-15 13:00:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 51 states have internal predecessors, (112), 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 13:00:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:00:54,617 INFO L225 Difference]: With dead ends: 458 [2023-02-15 13:00:54,618 INFO L226 Difference]: Without dead ends: 458 [2023-02-15 13:00:54,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 205.4s TimeCoverageRelationStatistics Valid=1181, Invalid=7534, Unknown=235, NotChecked=950, Total=9900 [2023-02-15 13:00:54,619 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 535 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:00:54,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 564 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1002 Invalid, 1 Unknown, 549 Unchecked, 2.4s Time] [2023-02-15 13:00:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-02-15 13:00:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 310. [2023-02-15 13:00:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.2274247491638797) internal successors, (367), 309 states have internal predecessors, (367), 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 13:00:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 367 transitions. [2023-02-15 13:00:54,624 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 367 transitions. Word has length 46 [2023-02-15 13:00:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:00:54,624 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 367 transitions. [2023-02-15 13:00:54,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.196078431372549) internal successors, (112), 51 states have internal predecessors, (112), 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 13:00:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 367 transitions. [2023-02-15 13:00:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:00:54,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:00:54,625 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2023-02-15 13:00:54,635 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 13:00:54,830 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,SelfDestructingSolverStorable39 [2023-02-15 13:00:54,832 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-02-15 13:00:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:00:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1565727437, now seen corresponding path program 1 times [2023-02-15 13:00:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:00:54,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695928330] [2023-02-15 13:00:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:00:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:00:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:00:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:00:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:00:55,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695928330] [2023-02-15 13:00:55,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695928330] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:00:55,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152625837] [2023-02-15 13:00:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:00:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:00:55,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:00:55,517 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 13:00:55,519 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 13:00:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:00:55,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-15 13:00:55,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:00:55,729 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 13:00:55,735 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 13:00:55,741 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 13:00:55,772 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 13:00:55,777 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 13:00:55,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:55,811 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 13:00:55,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:55,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:55,819 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 30 treesize of output 32 [2023-02-15 13:00:55,827 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 32 treesize of output 34 [2023-02-15 13:00:55,836 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 13:00:55,843 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 32 treesize of output 34 [2023-02-15 13:00:55,851 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 13:00:55,958 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:00:55,958 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 13:00:56,005 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 13:00:56,012 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 21 [2023-02-15 13:00:56,026 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 21 [2023-02-15 13:00:56,036 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 13:00:56,051 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 13:00:56,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 13:00:56,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:56,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-02-15 13:00:56,110 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 13:00:56,124 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 13:00:56,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:56,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-02-15 13:00:56,201 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:00:56,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 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:00:56,226 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 13:00:56,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2023-02-15 13:00:56,319 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-02-15 13:00:56,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 81 [2023-02-15 13:00:56,323 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 80 treesize of output 78 [2023-02-15 13:00:56,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:56,513 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 133 treesize of output 131 [2023-02-15 13:00:56,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:56,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 26 [2023-02-15 13:00:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:00:56,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:00:57,027 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-02-15 13:00:57,027 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 16 treesize of output 15 [2023-02-15 13:00:57,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16))) (and (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 .cse5 v_ArrVal_3286)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= .cse0 (select (select .cse1 .cse0) .cse2)))) (= .cse2 0)))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3286 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 .cse5 v_ArrVal_3286)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (or (= .cse6 (select (select .cse7 .cse6) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (= .cse6 0))))))) is different from false [2023-02-15 13:01:05,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:01:05,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 326 treesize of output 193 [2023-02-15 13:01:05,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:01:05,044 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 3 case distinctions, treesize of input 430 treesize of output 244 [2023-02-15 13:01:05,060 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse4 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_3285 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3286 Int)) (let ((.cse3 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse1 (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13))) (store .cse7 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~last~0#1.base|) .cse3 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse5 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3286))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (or (= .cse0 0) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select .cse1 .cse0) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3277))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse4)) .cse0)))))) (forall ((v_ArrVal_3285 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_3277 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_3286 Int)) (let ((.cse13 (+ |ULTIMATE.start_main_~last~0#1.offset| 12))) (let ((.cse10 (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3277))) (store .cse14 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~last~0#1.base|) .cse13 |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3285) |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (or (let ((.cse8 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12))) (store .cse12 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~last~0#1.base|) .cse13 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse11 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3286))))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~first~0#1.base|) .cse4))) (= (select (select .cse8 .cse9) .cse10) .cse9))) (= .cse10 0) (not (= (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))))))) is different from false