./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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-0513.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 aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:14:49,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:14:49,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:14:49,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:14:49,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:14:49,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:14:49,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:14:49,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:14:49,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:14:49,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:14:49,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:14:49,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:14:49,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:14:49,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:14:49,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:14:49,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:14:49,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:14:49,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:14:49,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:14:49,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:14:49,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:14:49,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:14:49,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:14:49,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:14:49,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:14:49,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:14:49,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:14:49,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:14:49,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:14:49,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:14:49,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:14:49,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:14:49,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:14:49,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:14:49,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:14:49,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:14:49,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:14:49,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:14:49,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:14:49,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:14:49,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:14:49,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:14:49,938 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:14:49,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:14:49,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:14:49,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:14:49,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:14:49,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:14:49,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:14:49,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:14:49,942 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:14:49,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:14:49,942 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:14:49,942 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:14:49,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:14:49,944 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:14:49,944 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:14:49,944 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:14:49,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:14:49,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:14:49,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:14:49,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:14:49,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:14:49,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:14:49,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:14:49,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:14:49,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:14:49,945 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:14:49,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:14:49,946 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:14:49,946 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 -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2023-02-16 03:14:50,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:14:50,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:14:50,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:14:50,240 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:14:50,244 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:14:50,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2023-02-16 03:14:51,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:14:51,510 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:14:51,513 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2023-02-16 03:14:51,529 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3f04ed1/ab31632072134866939f6311e869e7a7/FLAG806c0a008 [2023-02-16 03:14:51,546 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3f04ed1/ab31632072134866939f6311e869e7a7 [2023-02-16 03:14:51,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:14:51,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:14:51,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:14:51,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:14:51,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:14:51,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a60bef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51, skipping insertion in model container [2023-02-16 03:14:51,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:14:51,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:14:51,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:14:51,856 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:14:51,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:14:51,911 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:14:51,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51 WrapperNode [2023-02-16 03:14:51,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:14:51,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:14:51,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:14:51,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:14:51,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,968 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2023-02-16 03:14:51,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:14:51,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:14:51,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:14:51,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:14:51,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:51,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:52,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:52,001 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:52,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:52,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:14:52,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:14:52,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:14:52,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:14:52,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (1/1) ... [2023-02-16 03:14:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:14:52,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:52,039 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-16 03:14:52,059 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-16 03:14:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:14:52,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:14:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:14:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:14:52,223 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:14:52,238 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:14:52,464 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:14:52,469 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:14:52,470 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 03:14:52,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:14:52 BoogieIcfgContainer [2023-02-16 03:14:52,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:14:52,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:14:52,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:14:52,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:14:52,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:14:51" (1/3) ... [2023-02-16 03:14:52,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d044cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:14:52, skipping insertion in model container [2023-02-16 03:14:52,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:14:51" (2/3) ... [2023-02-16 03:14:52,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d044cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:14:52, skipping insertion in model container [2023-02-16 03:14:52,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:14:52" (3/3) ... [2023-02-16 03:14:52,476 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513.i [2023-02-16 03:14:52,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:14:52,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-02-16 03:14:52,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:14:52,519 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;@51e2b8bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:14:52,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-02-16 03:14:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:14:52,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:52,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:14:52,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2023-02-16 03:14:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:52,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071074636] [2023-02-16 03:14:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:52,633 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-16 03:14:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:52,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071074636] [2023-02-16 03:14:52,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071074636] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:52,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:52,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77961223] [2023-02-16 03:14:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:52,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:14:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:52,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:14:52,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:14:52,670 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 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-16 03:14:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:52,699 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2023-02-16 03:14:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:14:52,701 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-16 03:14:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:52,709 INFO L225 Difference]: With dead ends: 132 [2023-02-16 03:14:52,709 INFO L226 Difference]: Without dead ends: 130 [2023-02-16 03:14:52,710 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-16 03:14:52,720 INFO L413 NwaCegarLoop]: 140 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, 140 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-16 03:14:52,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-16 03:14:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-02-16 03:14:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2023-02-16 03:14:52,783 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2023-02-16 03:14:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:52,783 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2023-02-16 03:14:52,783 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-16 03:14:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2023-02-16 03:14:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:52,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:52,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:52,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:14:52,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2023-02-16 03:14:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:52,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286902996] [2023-02-16 03:14:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:52,840 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-16 03:14:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:52,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286902996] [2023-02-16 03:14:52,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286902996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:52,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:52,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819447810] [2023-02-16 03:14:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:52,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:52,844 INFO L87 Difference]: Start difference. First operand 130 states and 138 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-16 03:14:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:52,965 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2023-02-16 03:14:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:52,965 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-16 03:14:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:52,966 INFO L225 Difference]: With dead ends: 176 [2023-02-16 03:14:52,966 INFO L226 Difference]: Without dead ends: 175 [2023-02-16 03:14:52,967 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-16 03:14:52,968 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:52,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-16 03:14:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2023-02-16 03:14:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2023-02-16 03:14:52,973 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2023-02-16 03:14:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:52,973 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2023-02-16 03:14:52,974 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-16 03:14:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2023-02-16 03:14:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:52,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:52,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:52,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:14:52,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2023-02-16 03:14:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124653864] [2023-02-16 03:14:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,012 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-16 03:14:53,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124653864] [2023-02-16 03:14:53,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124653864] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152538030] [2023-02-16 03:14:53,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:53,015 INFO L87 Difference]: Start difference. First operand 133 states and 142 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-16 03:14:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,053 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2023-02-16 03:14:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:53,054 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-16 03:14:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,054 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:14:53,055 INFO L226 Difference]: Without dead ends: 144 [2023-02-16 03:14:53,055 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-16 03:14:53,056 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:14:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-16 03:14:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2023-02-16 03:14:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 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-16 03:14:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2023-02-16 03:14:53,060 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2023-02-16 03:14:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,061 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2023-02-16 03:14:53,061 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-16 03:14:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2023-02-16 03:14:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:53,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:14:53,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2023-02-16 03:14:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036254474] [2023-02-16 03:14:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,102 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-16 03:14:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036254474] [2023-02-16 03:14:53,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036254474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:53,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327397143] [2023-02-16 03:14:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:53,104 INFO L87 Difference]: Start difference. First operand 138 states and 150 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-16 03:14:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,189 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2023-02-16 03:14:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:53,190 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-16 03:14:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,191 INFO L225 Difference]: With dead ends: 169 [2023-02-16 03:14:53,191 INFO L226 Difference]: Without dead ends: 169 [2023-02-16 03:14:53,192 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-16 03:14:53,195 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 75 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-16 03:14:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2023-02-16 03:14:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2023-02-16 03:14:53,200 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2023-02-16 03:14:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,200 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2023-02-16 03:14:53,200 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-16 03:14:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2023-02-16 03:14:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:14:53,201 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:14:53,201 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2023-02-16 03:14:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400961902] [2023-02-16 03:14:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,279 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-16 03:14:53,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400961902] [2023-02-16 03:14:53,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400961902] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681391107] [2023-02-16 03:14:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:53,283 INFO L87 Difference]: Start difference. First operand 139 states and 153 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-16 03:14:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,358 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2023-02-16 03:14:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:53,359 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-16 03:14:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,359 INFO L225 Difference]: With dead ends: 137 [2023-02-16 03:14:53,359 INFO L226 Difference]: Without dead ends: 137 [2023-02-16 03:14:53,360 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-16 03:14:53,364 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-16 03:14:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-02-16 03:14:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-02-16 03:14:53,381 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2023-02-16 03:14:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,381 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-02-16 03:14:53,382 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-16 03:14:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2023-02-16 03:14:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:14:53,382 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:14:53,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2023-02-16 03:14:53,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836776200] [2023-02-16 03:14:53,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,481 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-16 03:14:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836776200] [2023-02-16 03:14:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836776200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308259910] [2023-02-16 03:14:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:53,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:53,485 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,554 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2023-02-16 03:14:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:53,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:14:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,555 INFO L225 Difference]: With dead ends: 133 [2023-02-16 03:14:53,556 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:14:53,556 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-16 03:14:53,557 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:14:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-02-16 03:14:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-16 03:14:53,565 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2023-02-16 03:14:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,565 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-16 03:14:53,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-16 03:14:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:14:53,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:14:53,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2023-02-16 03:14:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381783217] [2023-02-16 03:14:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,626 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-16 03:14:53,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381783217] [2023-02-16 03:14:53,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381783217] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:14:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522217053] [2023-02-16 03:14:53,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:14:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:14:53,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:14:53,629 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,686 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2023-02-16 03:14:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:14:53,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:14:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,688 INFO L225 Difference]: With dead ends: 130 [2023-02-16 03:14:53,688 INFO L226 Difference]: Without dead ends: 130 [2023-02-16 03:14:53,688 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-16 03:14:53,689 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-16 03:14:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-02-16 03:14:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2023-02-16 03:14:53,691 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2023-02-16 03:14:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,692 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2023-02-16 03:14:53,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2023-02-16 03:14:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:14:53,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,692 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:14:53,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2023-02-16 03:14:53,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251555929] [2023-02-16 03:14:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,735 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-16 03:14:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251555929] [2023-02-16 03:14:53,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251555929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:14:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975032264] [2023-02-16 03:14:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:53,738 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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-16 03:14:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:53,817 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2023-02-16 03:14:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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-16 03:14:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:53,818 INFO L225 Difference]: With dead ends: 228 [2023-02-16 03:14:53,819 INFO L226 Difference]: Without dead ends: 228 [2023-02-16 03:14:53,819 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-16 03:14:53,819 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 126 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:53,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-16 03:14:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2023-02-16 03:14:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2023-02-16 03:14:53,822 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2023-02-16 03:14:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:53,822 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2023-02-16 03:14:53,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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-16 03:14:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2023-02-16 03:14:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:14:53,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:53,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:53,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:14:53,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2023-02-16 03:14:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173555175] [2023-02-16 03:14:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:53,869 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-16 03:14:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:53,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173555175] [2023-02-16 03:14:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173555175] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:53,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:53,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:14:53,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417333133] [2023-02-16 03:14:53,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:53,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:14:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:14:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:14:53,871 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-16 03:14:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:54,002 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2023-02-16 03:14:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:54,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-16 03:14:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:54,003 INFO L225 Difference]: With dead ends: 124 [2023-02-16 03:14:54,003 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:14:54,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:14:54,004 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:54,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 213 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:14:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2023-02-16 03:14:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2023-02-16 03:14:54,007 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2023-02-16 03:14:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:54,007 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2023-02-16 03:14:54,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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-16 03:14:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2023-02-16 03:14:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:14:54,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:54,007 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:54,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:14:54,008 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2023-02-16 03:14:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:54,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974731160] [2023-02-16 03:14:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:54,122 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-16 03:14:54,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:54,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974731160] [2023-02-16 03:14:54,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974731160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:54,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:54,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:54,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398152680] [2023-02-16 03:14:54,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:54,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:54,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:54,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:54,125 INFO L87 Difference]: Start difference. First operand 123 states and 134 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-16 03:14:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:54,261 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2023-02-16 03:14:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:54,262 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-16 03:14:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:54,262 INFO L225 Difference]: With dead ends: 204 [2023-02-16 03:14:54,262 INFO L226 Difference]: Without dead ends: 204 [2023-02-16 03:14:54,263 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-16 03:14:54,263 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:54,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 168 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-16 03:14:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2023-02-16 03:14:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2023-02-16 03:14:54,266 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2023-02-16 03:14:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:54,266 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2023-02-16 03:14:54,266 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-16 03:14:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2023-02-16 03:14:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:14:54,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:54,267 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-16 03:14:54,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:14:54,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2023-02-16 03:14:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906789964] [2023-02-16 03:14:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:54,311 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-16 03:14:54,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:54,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906789964] [2023-02-16 03:14:54,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906789964] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:54,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:54,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:14:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745434371] [2023-02-16 03:14:54,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:54,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:14:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:14:54,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:14:54,313 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-16 03:14:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:54,417 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2023-02-16 03:14:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:14:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-16 03:14:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:54,418 INFO L225 Difference]: With dead ends: 205 [2023-02-16 03:14:54,418 INFO L226 Difference]: Without dead ends: 205 [2023-02-16 03:14:54,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:14:54,418 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 224 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:54,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 309 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-16 03:14:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2023-02-16 03:14:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2023-02-16 03:14:54,421 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2023-02-16 03:14:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:54,421 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2023-02-16 03:14:54,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-16 03:14:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2023-02-16 03:14:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:14:54,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:54,422 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-16 03:14:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:14:54,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2023-02-16 03:14:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301787587] [2023-02-16 03:14:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:54,565 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-16 03:14:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:54,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301787587] [2023-02-16 03:14:54,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301787587] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:54,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:54,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:14:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706378032] [2023-02-16 03:14:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:54,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:14:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:14:54,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:14:54,568 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-16 03:14:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:54,703 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2023-02-16 03:14:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:14:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-16 03:14:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:54,704 INFO L225 Difference]: With dead ends: 191 [2023-02-16 03:14:54,704 INFO L226 Difference]: Without dead ends: 191 [2023-02-16 03:14:54,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:14:54,705 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:54,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 399 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-16 03:14:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2023-02-16 03:14:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2023-02-16 03:14:54,708 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2023-02-16 03:14:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:54,708 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2023-02-16 03:14:54,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-16 03:14:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2023-02-16 03:14:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:14:54,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:54,709 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] [2023-02-16 03:14:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:14:54,709 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2023-02-16 03:14:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:54,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593642665] [2023-02-16 03:14:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:55,029 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-16 03:14:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593642665] [2023-02-16 03:14:55,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593642665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:55,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:55,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:14:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304398266] [2023-02-16 03:14:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:55,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:14:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:14:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:14:55,031 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:55,432 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2023-02-16 03:14:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:14:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-16 03:14:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:55,434 INFO L225 Difference]: With dead ends: 228 [2023-02-16 03:14:55,434 INFO L226 Difference]: Without dead ends: 228 [2023-02-16 03:14:55,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:14:55,434 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:55,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 491 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:14:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-16 03:14:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2023-02-16 03:14:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2023-02-16 03:14:55,437 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2023-02-16 03:14:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:55,438 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2023-02-16 03:14:55,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2023-02-16 03:14:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:14:55,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:55,438 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] [2023-02-16 03:14:55,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 03:14:55,438 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2023-02-16 03:14:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:55,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027234299] [2023-02-16 03:14:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:55,909 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-16 03:14:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:55,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027234299] [2023-02-16 03:14:55,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027234299] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:55,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:55,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:14:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600245394] [2023-02-16 03:14:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:55,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:14:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:14:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:14:55,911 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:56,297 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2023-02-16 03:14:56,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:14:56,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-16 03:14:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:56,298 INFO L225 Difference]: With dead ends: 207 [2023-02-16 03:14:56,298 INFO L226 Difference]: Without dead ends: 207 [2023-02-16 03:14:56,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:14:56,299 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 92 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:56,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 354 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:14:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-16 03:14:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2023-02-16 03:14:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2023-02-16 03:14:56,302 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2023-02-16 03:14:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:56,302 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2023-02-16 03:14:56,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2023-02-16 03:14:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:14:56,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:56,303 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] [2023-02-16 03:14:56,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 03:14:56,304 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2023-02-16 03:14:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:56,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352470714] [2023-02-16 03:14:56,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:56,470 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-16 03:14:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352470714] [2023-02-16 03:14:56,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352470714] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:56,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:56,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:14:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416688196] [2023-02-16 03:14:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:56,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:14:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:56,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:14:56,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:14:56,472 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:56,587 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2023-02-16 03:14:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:14:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:14:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:56,588 INFO L225 Difference]: With dead ends: 194 [2023-02-16 03:14:56,589 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 03:14:56,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:14:56,589 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 40 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:56,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 412 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 03:14:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2023-02-16 03:14:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2023-02-16 03:14:56,592 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2023-02-16 03:14:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:56,592 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2023-02-16 03:14:56,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2023-02-16 03:14:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:14:56,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:56,592 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-16 03:14:56,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:14:56,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2023-02-16 03:14:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:56,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794006393] [2023-02-16 03:14:56,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:56,814 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-16 03:14:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:56,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794006393] [2023-02-16 03:14:56,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794006393] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:56,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:56,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:14:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528373807] [2023-02-16 03:14:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:56,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:14:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:56,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:14:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:14:56,818 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:57,015 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2023-02-16 03:14:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:14:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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-16 03:14:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:57,016 INFO L225 Difference]: With dead ends: 229 [2023-02-16 03:14:57,016 INFO L226 Difference]: Without dead ends: 229 [2023-02-16 03:14:57,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:14:57,017 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 200 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:57,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 463 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-16 03:14:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2023-02-16 03:14:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2023-02-16 03:14:57,020 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2023-02-16 03:14:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:57,020 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2023-02-16 03:14:57,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2023-02-16 03:14:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:14:57,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:57,021 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, 1] [2023-02-16 03:14:57,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:14:57,021 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2023-02-16 03:14:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:57,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241795147] [2023-02-16 03:14:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:57,212 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-16 03:14:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:57,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241795147] [2023-02-16 03:14:57,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241795147] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:57,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:57,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:14:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627270472] [2023-02-16 03:14:57,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:57,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:14:57,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:57,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:14:57,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:14:57,214 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:57,403 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2023-02-16 03:14:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:14:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 03:14:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:57,405 INFO L225 Difference]: With dead ends: 200 [2023-02-16 03:14:57,405 INFO L226 Difference]: Without dead ends: 200 [2023-02-16 03:14:57,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:14:57,405 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 47 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:57,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 504 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-16 03:14:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2023-02-16 03:14:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2023-02-16 03:14:57,408 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2023-02-16 03:14:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:57,408 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2023-02-16 03:14:57,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,408 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2023-02-16 03:14:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:14:57,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:57,409 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, 1, 1] [2023-02-16 03:14:57,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:14:57,409 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2023-02-16 03:14:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900942096] [2023-02-16 03:14:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:57,468 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-16 03:14:57,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:57,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900942096] [2023-02-16 03:14:57,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900942096] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:14:57,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:14:57,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:14:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584898159] [2023-02-16 03:14:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:14:57,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:14:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:14:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:14:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:14:57,470 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:14:57,582 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2023-02-16 03:14:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:14:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-16 03:14:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:14:57,583 INFO L225 Difference]: With dead ends: 251 [2023-02-16 03:14:57,583 INFO L226 Difference]: Without dead ends: 251 [2023-02-16 03:14:57,583 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-16 03:14:57,583 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:14:57,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:14:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-16 03:14:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2023-02-16 03:14:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2023-02-16 03:14:57,586 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2023-02-16 03:14:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:14:57,586 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2023-02-16 03:14:57,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:14:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2023-02-16 03:14:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:14:57,586 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:14:57,587 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:14:57,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 03:14:57,587 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:14:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:14:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2023-02-16 03:14:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:14:57,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052375995] [2023-02-16 03:14:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:14:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:58,114 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-16 03:14:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:14:58,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052375995] [2023-02-16 03:14:58,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052375995] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:14:58,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276832229] [2023-02-16 03:14:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:14:58,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:14:58,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:14:58,118 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-16 03:14:58,147 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-16 03:14:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:14:58,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 03:14:58,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:14:58,284 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-16 03:14:58,303 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-16 03:14:58,327 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 19 treesize of output 18 [2023-02-16 03:14:58,331 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 19 treesize of output 18 [2023-02-16 03:14:58,379 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:14:58,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:14:58,408 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:14:58,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:14:58,460 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:14:58,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-02-16 03:14:58,478 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-16 03:14:58,670 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-16 03:14:58,924 INFO L321 Elim1Store]: treesize reduction 85, result has 44.4 percent of original size [2023-02-16 03:14:58,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 118 [2023-02-16 03:14:58,946 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-16 03:14:58,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2023-02-16 03:14:58,962 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:14:58,962 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 48 treesize of output 48 [2023-02-16 03:14:59,108 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-16 03:14:59,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:14:59,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 03:14:59,570 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2023-02-16 03:14:59,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 59 treesize of output 64 [2023-02-16 03:14:59,584 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:14:59,593 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-16 03:14:59,715 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 49 treesize of output 45 [2023-02-16 03:14:59,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))) (.cse0 (not .cse5))) (and (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse1 v_arrayElimCell_19) 0) 0) (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))))) .cse3)) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse4 v_arrayElimCell_20) 0) 0) (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= v_arrayElimCell_20 |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0) (= v_arrayElimCell_20 |ULTIMATE.start_main_~lItem~0#1.base|)))) .cse5) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse6 v_arrayElimCell_20) 0) 0) (= (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))) .cse0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse7 v_arrayElimCell_20) 0) 0) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= v_arrayElimCell_20 |ULTIMATE.start_main_~lItem~0#1.base|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (or .cse5 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0) (= v_arrayElimCell_20 |ULTIMATE.start_main_~lItem~0#1.base|) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse9 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse8 .cse9) 0) 0) (= (select (select .cse8 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= .cse9 |ULTIMATE.start_main_~lItem~0#1.base|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse10 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse10) 0) 0) (= .cse10 |ULTIMATE.start_main_~lItem~0#1.base|))))) .cse5) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse12 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse11 .cse12) 0) 0) (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= .cse12 |ULTIMATE.start_main_~lItem~0#1.base|)))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (= v_arrayElimCell_19 |ULTIMATE.start_main_~lItem~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse13 v_arrayElimCell_19) 0) 0) (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) .cse3) .cse0) (or (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) .cse0) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse14 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse14) 0) 0) (= .cse14 |ULTIMATE.start_main_~lItem~0#1.base|) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))) .cse5) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) .cse0)))) is different from false [2023-02-16 03:14:59,973 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse0 v_arrayElimCell_20) 0) 0) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= v_arrayElimCell_20 |ULTIMATE.start_main_~lItem~0#1.base|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 v_arrayElimCell_20) 0) 0) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 v_arrayElimCell_19) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_19 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse3 v_arrayElimCell_19) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= v_arrayElimCell_19 |ULTIMATE.start_main_~lItem~0#1.base|))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_1 4))) (or (not (= .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse4) 0) 0)))) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))) is different from false [2023-02-16 03:15:00,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:00,571 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 29 treesize of output 35 [2023-02-16 03:15:00,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:15:00,578 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:15:00,579 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 20 treesize of output 11 [2023-02-16 03:15:00,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:15:00,585 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 03:15:00,586 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2023-02-16 03:15:00,590 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-16 03:15:00,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276832229] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:00,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:00,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 41 [2023-02-16 03:15:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242960562] [2023-02-16 03:15:00,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:00,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 03:15:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 03:15:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1279, Unknown=33, NotChecked=150, Total=1640 [2023-02-16 03:15:00,592 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:02,577 INFO L93 Difference]: Finished difference Result 216 states and 268 transitions. [2023-02-16 03:15:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:15:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 03:15:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:02,578 INFO L225 Difference]: With dead ends: 216 [2023-02-16 03:15:02,578 INFO L226 Difference]: Without dead ends: 216 [2023-02-16 03:15:02,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=531, Invalid=2983, Unknown=34, NotChecked=234, Total=3782 [2023-02-16 03:15:02,580 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 332 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 63 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:02,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1135 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1065 Invalid, 4 Unknown, 230 Unchecked, 0.7s Time] [2023-02-16 03:15:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-16 03:15:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 186. [2023-02-16 03:15:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2023-02-16 03:15:02,583 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2023-02-16 03:15:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:02,583 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2023-02-16 03:15:02,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2023-02-16 03:15:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:15:02,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:02,583 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, 1, 1, 1, 1, 1] [2023-02-16 03:15:02,606 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-16 03:15:02,789 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-16 03:15:02,789 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2023-02-16 03:15:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:02,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516527907] [2023-02-16 03:15:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:03,137 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-16 03:15:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:03,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516527907] [2023-02-16 03:15:03,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516527907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:03,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174481993] [2023-02-16 03:15:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:03,149 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-16 03:15:03,199 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-16 03:15:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:03,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 03:15:03,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:03,316 INFO L321 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-02-16 03:15:03,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2023-02-16 03:15:03,383 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-16 03:15:03,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:03,458 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 30 [2023-02-16 03:15:03,563 INFO L321 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-02-16 03:15:03,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2023-02-16 03:15:03,693 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:03,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 30 treesize of output 39 [2023-02-16 03:15:03,743 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-16 03:15:03,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:04,090 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 102 treesize of output 84 [2023-02-16 03:15:04,189 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 76 treesize of output 64 [2023-02-16 03:15:30,397 WARN L233 SmtUtils]: Spent 26.11s on a formula simplification. DAG size of input: 59 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:15:35,035 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-16 03:15:35,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174481993] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:35,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:35,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2023-02-16 03:15:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916700023] [2023-02-16 03:15:35,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:35,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-16 03:15:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-16 03:15:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 03:15:35,038 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:36,581 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2023-02-16 03:15:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:15:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 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-16 03:15:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:36,583 INFO L225 Difference]: With dead ends: 188 [2023-02-16 03:15:36,583 INFO L226 Difference]: Without dead ends: 171 [2023-02-16 03:15:36,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2023-02-16 03:15:36,584 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 41 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:36,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 958 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-16 03:15:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-16 03:15:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-02-16 03:15:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 170 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2023-02-16 03:15:36,588 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 33 [2023-02-16 03:15:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:36,588 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2023-02-16 03:15:36,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2023-02-16 03:15:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:15:36,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:36,588 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:36,595 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-16 03:15:36,800 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-16 03:15:36,801 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:36,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679628, now seen corresponding path program 1 times [2023-02-16 03:15:36,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:36,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550392024] [2023-02-16 03:15:36,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:36,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550392024] [2023-02-16 03:15:37,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550392024] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587995751] [2023-02-16 03:15:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:37,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:37,098 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-16 03:15:37,159 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-16 03:15:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:37,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 03:15:37,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:37,244 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-16 03:15:37,265 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:37,265 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-16 03:15:37,275 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-16 03:15:37,282 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:15:37,282 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-16 03:15:37,311 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-16 03:15:37,316 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-16 03:15:37,339 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:15:37,340 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-16 03:15:37,342 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-16 03:15:37,394 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-16 03:15:37,397 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-16 03:15:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:37,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:37,466 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (forall ((v_ArrVal_623 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 4)))) is different from false [2023-02-16 03:15:37,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:37,473 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 37 treesize of output 38 [2023-02-16 03:15:37,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:37,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-16 03:15:37,482 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 52 treesize of output 44 [2023-02-16 03:15:37,484 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 82 treesize of output 70 [2023-02-16 03:15:37,488 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 34 treesize of output 30 [2023-02-16 03:15:37,490 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 62 treesize of output 58 [2023-02-16 03:15:37,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:37,518 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 20 treesize of output 21 [2023-02-16 03:15:37,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:15:37,521 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 18 treesize of output 10 [2023-02-16 03:15:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 03:15:37,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587995751] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:37,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:37,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2023-02-16 03:15:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147574511] [2023-02-16 03:15:37,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:37,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:15:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:15:37,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2023-02-16 03:15:37,663 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:40,287 INFO L93 Difference]: Finished difference Result 190 states and 236 transitions. [2023-02-16 03:15:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:15:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 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 37 [2023-02-16 03:15:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:40,297 INFO L225 Difference]: With dead ends: 190 [2023-02-16 03:15:40,297 INFO L226 Difference]: Without dead ends: 190 [2023-02-16 03:15:40,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=518, Unknown=1, NotChecked=48, Total=702 [2023-02-16 03:15:40,298 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:40,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 514 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 581 Invalid, 1 Unknown, 105 Unchecked, 0.4s Time] [2023-02-16 03:15:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-16 03:15:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2023-02-16 03:15:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 170 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:40,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2023-02-16 03:15:40,301 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 37 [2023-02-16 03:15:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:40,301 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2023-02-16 03:15:40,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2023-02-16 03:15:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:15:40,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:40,301 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:40,310 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-16 03:15:40,507 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-16 03:15:40,508 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:40,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679629, now seen corresponding path program 1 times [2023-02-16 03:15:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:40,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571974342] [2023-02-16 03:15:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571974342] [2023-02-16 03:15:40,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571974342] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783174043] [2023-02-16 03:15:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:40,733 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-16 03:15:40,736 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-16 03:15:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:40,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 03:15:40,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:40,847 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-16 03:15:40,872 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:40,873 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-16 03:15:40,895 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:40,895 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-16 03:15:40,937 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-16 03:15:40,975 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:15:40,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-16 03:15:41,020 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-16 03:15:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:41,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:15:41,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783174043] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:41,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:15:41,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2023-02-16 03:15:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529162489] [2023-02-16 03:15:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:41,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:15:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:15:41,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:15:41,037 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:41,314 INFO L93 Difference]: Finished difference Result 176 states and 222 transitions. [2023-02-16 03:15:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:15:41,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 03:15:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:41,316 INFO L225 Difference]: With dead ends: 176 [2023-02-16 03:15:41,316 INFO L226 Difference]: Without dead ends: 176 [2023-02-16 03:15:41,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:15:41,317 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 71 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:41,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 291 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:15:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-16 03:15:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2023-02-16 03:15:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 170 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2023-02-16 03:15:41,319 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 37 [2023-02-16 03:15:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:41,319 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2023-02-16 03:15:41,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2023-02-16 03:15:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:15:41,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:41,320 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:41,336 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-16 03:15:41,526 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-16 03:15:41,527 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 507133380, now seen corresponding path program 1 times [2023-02-16 03:15:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:41,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929112237] [2023-02-16 03:15:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:41,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929112237] [2023-02-16 03:15:41,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929112237] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:41,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227551544] [2023-02-16 03:15:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:41,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:41,739 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-16 03:15:41,741 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-16 03:15:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:41,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-16 03:15:41,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:41,846 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-16 03:15:41,883 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:15:41,883 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-16 03:15:41,901 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:15:41,902 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-16 03:15:41,915 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-16 03:15:41,926 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:15:41,926 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 19 treesize of output 22 [2023-02-16 03:15:41,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-16 03:15:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:41,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:41,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:41,983 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 19 treesize of output 20 [2023-02-16 03:15:41,985 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 33 treesize of output 25 [2023-02-16 03:15:41,988 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-16 03:15:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:42,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227551544] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:42,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:42,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2023-02-16 03:15:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570068348] [2023-02-16 03:15:42,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:42,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:15:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:15:42,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=98, Unknown=2, NotChecked=0, Total=132 [2023-02-16 03:15:42,036 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:42,157 WARN L837 $PredicateComparison]: unable to prove that (and (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|)) (forall ((v_ArrVal_887 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))))) is different from false [2023-02-16 03:15:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:42,271 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2023-02-16 03:15:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:15:42,271 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-16 03:15:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:42,272 INFO L225 Difference]: With dead ends: 171 [2023-02-16 03:15:42,272 INFO L226 Difference]: Without dead ends: 171 [2023-02-16 03:15:42,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=4, NotChecked=34, Total=380 [2023-02-16 03:15:42,272 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 146 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:42,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 458 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:15:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-16 03:15:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2023-02-16 03:15:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.6589147286821706) internal successors, (214), 166 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2023-02-16 03:15:42,275 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 40 [2023-02-16 03:15:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:42,275 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2023-02-16 03:15:42,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2023-02-16 03:15:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:15:42,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:42,275 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:42,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 03:15:42,475 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-16 03:15:42,476 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299147, now seen corresponding path program 1 times [2023-02-16 03:15:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:42,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479400947] [2023-02-16 03:15:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-16 03:15:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479400947] [2023-02-16 03:15:42,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479400947] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:42,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:15:42,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:15:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294129994] [2023-02-16 03:15:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:42,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:15:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:15:42,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:15:42,543 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:42,675 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2023-02-16 03:15:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:15:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 41 [2023-02-16 03:15:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:42,677 INFO L225 Difference]: With dead ends: 166 [2023-02-16 03:15:42,677 INFO L226 Difference]: Without dead ends: 166 [2023-02-16 03:15:42,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:15:42,677 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:42,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 305 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:15:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-16 03:15:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-02-16 03:15:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2023-02-16 03:15:42,679 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 41 [2023-02-16 03:15:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:42,680 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2023-02-16 03:15:42,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2023-02-16 03:15:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:15:42,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:42,680 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:42,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-16 03:15:42,680 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299146, now seen corresponding path program 1 times [2023-02-16 03:15:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:42,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365788652] [2023-02-16 03:15:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:42,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365788652] [2023-02-16 03:15:42,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365788652] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127549061] [2023-02-16 03:15:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:42,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:42,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:42,955 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-16 03:15:42,956 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-16 03:15:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:43,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:15:43,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:43,160 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-16 03:15:43,192 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:15:43,193 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 25 treesize of output 23 [2023-02-16 03:15:43,304 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 23 treesize of output 15 [2023-02-16 03:15:43,307 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 26 treesize of output 14 [2023-02-16 03:15:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:43,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:15:43,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127549061] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:15:43,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:15:43,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2023-02-16 03:15:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300439135] [2023-02-16 03:15:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:15:43,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:15:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:43,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:15:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:15:43,345 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:43,681 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2023-02-16 03:15:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:15:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-16 03:15:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:43,682 INFO L225 Difference]: With dead ends: 226 [2023-02-16 03:15:43,682 INFO L226 Difference]: Without dead ends: 226 [2023-02-16 03:15:43,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2023-02-16 03:15:43,683 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 333 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:43,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 409 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:15:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-16 03:15:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 166. [2023-02-16 03:15:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.627906976744186) internal successors, (210), 165 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2023-02-16 03:15:43,708 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 41 [2023-02-16 03:15:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:43,708 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2023-02-16 03:15:43,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2023-02-16 03:15:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:15:43,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:43,709 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:43,723 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-16 03:15:43,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:43,913 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash -716785192, now seen corresponding path program 1 times [2023-02-16 03:15:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:43,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707406740] [2023-02-16 03:15:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707406740] [2023-02-16 03:15:44,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707406740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689076672] [2023-02-16 03:15:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:44,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:44,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:44,133 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-16 03:15:44,173 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-16 03:15:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:44,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:15:44,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:44,347 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-16 03:15:44,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:44,373 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-16 03:15:44,423 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 17 treesize of output 9 [2023-02-16 03:15:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:44,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:44,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689076672] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:15:44,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:15:44,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-02-16 03:15:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043676427] [2023-02-16 03:15:44,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:15:44,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:15:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:15:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:15:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:15:44,560 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 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-16 03:15:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:15:45,079 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2023-02-16 03:15:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:15:45,079 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 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) Word has length 45 [2023-02-16 03:15:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:15:45,080 INFO L225 Difference]: With dead ends: 186 [2023-02-16 03:15:45,080 INFO L226 Difference]: Without dead ends: 186 [2023-02-16 03:15:45,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2023-02-16 03:15:45,081 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 687 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:15:45,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 662 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:15:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-16 03:15:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2023-02-16 03:15:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.62015503875969) internal successors, (209), 165 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:15:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2023-02-16 03:15:45,091 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 45 [2023-02-16 03:15:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:15:45,091 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2023-02-16 03:15:45,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 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-16 03:15:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2023-02-16 03:15:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:15:45,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:15:45,092 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:15:45,098 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-16 03:15:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:45,298 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:15:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:15:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 829868235, now seen corresponding path program 1 times [2023-02-16 03:15:45,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:15:45,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680720387] [2023-02-16 03:15:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:15:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:46,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:15:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680720387] [2023-02-16 03:15:46,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680720387] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:15:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31127451] [2023-02-16 03:15:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:15:46,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:15:46,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:15:46,067 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-16 03:15:46,068 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-16 03:15:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:15:46,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-16 03:15:46,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:15:46,208 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-16 03:15:46,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:15:46,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-16 03:15:46,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-16 03:15:46,321 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-16 03:15:46,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-02-16 03:15:46,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-16 03:15:46,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-16 03:15:46,468 INFO L321 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2023-02-16 03:15:46,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2023-02-16 03:15:46,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-16 03:15:46,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:46,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2023-02-16 03:15:46,706 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:15:46,706 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2023-02-16 03:15:47,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:15:47,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:15:47,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2023-02-16 03:15:47,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-16 03:15:47,324 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:15:47,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2023-02-16 03:15:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:15:47,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:15:47,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 32 treesize of output 20 [2023-02-16 03:15:47,839 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse3 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse4 .cse2))) 1)))) (and (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse0 v_ArrVal_1368) (select .cse1 .cse2)) 1) (= .cse0 |c_ULTIMATE.start_main_~data~0#1.base|))))) (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse3) (or .cse3 (< |c_ULTIMATE.start_main_~data~0#1.offset| 1))))) is different from false [2023-02-16 03:15:47,854 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (let ((.cse0 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (store .cse4 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse5 .cse3))) 1)))) (and (or .cse0 (< |c_ULTIMATE.start_main_~data~0#1.offset| 1)) (or .cse0 (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1))) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse2 (select (store .cse4 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 v_ArrVal_1368) (select .cse2 .cse3)) 1) (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|)))))))) is different from false [2023-02-16 03:15:47,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse6 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse5 .cse3))) 1)))) (and (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse0) (or .cse0 (< |c_ULTIMATE.start_main_~data~0#1.offset| 1)) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse2 (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse4 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 v_ArrVal_1368) (select .cse2 .cse3)) 1) (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|)))))))) is different from false [2023-02-16 03:15:48,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:48,413 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 161 treesize of output 111 [2023-02-16 03:15:48,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:15:48,426 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 657 treesize of output 650 [2023-02-16 03:15:48,431 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 635 treesize of output 571 [2023-02-16 03:15:48,438 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 187 treesize of output 179 [2023-02-16 03:15:48,443 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 366 treesize of output 350 [2023-02-16 03:17:02,954 WARN L233 SmtUtils]: Spent 14.29s on a formula simplification. DAG size of input: 326 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:17:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 03:17:05,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31127451] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:17:05,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:17:05,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 21] total 52 [2023-02-16 03:17:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861375098] [2023-02-16 03:17:05,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:17:05,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-16 03:17:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:17:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-16 03:17:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2168, Unknown=5, NotChecked=294, Total=2756 [2023-02-16 03:17:05,555 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 53 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:17:09,550 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (or (not (<= 0 |c_ULTIMATE.start_main_~data~0#1.offset|)) (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse2 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse0 .cse1))) 1)) (< |c_ULTIMATE.start_main_~data~0#1.offset| 1)) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse5 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse3 v_ArrVal_1368) (select .cse4 .cse1)) 1) (= .cse3 |c_ULTIMATE.start_main_~data~0#1.base|))))))))) is different from false [2023-02-16 03:17:10,267 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (or (not (<= 0 |c_ULTIMATE.start_main_~data~0#1.offset|)) (not (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse2 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse0 .cse1))) 1)) (< |c_ULTIMATE.start_main_~data~0#1.offset| 1)) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse5 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse3 v_ArrVal_1368) (select .cse4 .cse1)) 1) (= .cse3 |c_ULTIMATE.start_main_~data~0#1.base|))))))))) is different from false [2023-02-16 03:17:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:17:10,296 INFO L93 Difference]: Finished difference Result 265 states and 320 transitions. [2023-02-16 03:17:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-16 03:17:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 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 48 [2023-02-16 03:17:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:17:10,298 INFO L225 Difference]: With dead ends: 265 [2023-02-16 03:17:10,298 INFO L226 Difference]: Without dead ends: 265 [2023-02-16 03:17:10,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=727, Invalid=4115, Unknown=8, NotChecked=700, Total=5550 [2023-02-16 03:17:10,299 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 309 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 59 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:17:10,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1203 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2058 Invalid, 5 Unknown, 482 Unchecked, 1.6s Time] [2023-02-16 03:17:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-16 03:17:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 164. [2023-02-16 03:17:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 163 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:17:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2023-02-16 03:17:10,308 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 48 [2023-02-16 03:17:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:17:10,309 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2023-02-16 03:17:10,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:17:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2023-02-16 03:17:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:17:10,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:17:10,309 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:17:10,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-16 03:17:10,510 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,SelfDestructingSolverStorable26 [2023-02-16 03:17:10,510 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-16 03:17:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:17:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 829868236, now seen corresponding path program 1 times [2023-02-16 03:17:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:17:10,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561328264] [2023-02-16 03:17:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:17:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:17:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:17:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:17:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:17:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561328264] [2023-02-16 03:17:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561328264] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:17:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453086844] [2023-02-16 03:17:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:17:11,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:17:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:17:11,501 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-16 03:17:11,503 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-16 03:17:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:17:11,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-16 03:17:11,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:17:11,649 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-16 03:17:11,652 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-16 03:17:11,698 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:17:11,698 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-16 03:17:11,706 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-16 03:17:11,782 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-16 03:17:11,787 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-16 03:17:11,850 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-16 03:17:11,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-16 03:17:11,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:17:11,914 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-16 03:17:11,920 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 41 treesize of output 37 [2023-02-16 03:17:11,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:17:11,965 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 41 treesize of output 37 [2023-02-16 03:17:12,022 INFO L321 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-02-16 03:17:12,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-02-16 03:17:12,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:17:12,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 32 treesize of output 30 [2023-02-16 03:17:12,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:17:12,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:17:12,143 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 19 treesize of output 18 [2023-02-16 03:17:12,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:17:12,148 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 37 treesize of output 28 [2023-02-16 03:17:12,198 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:17:12,198 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 67 treesize of output 58 [2023-02-16 03:17:12,202 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 27 treesize of output 22 [2023-02-16 03:17:12,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:17:12,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:17:12,446 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 28 [2023-02-16 03:17:12,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:17:12,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:17:12,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-16 03:17:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:17:12,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:17:13,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|))) (and (or (forall ((v_ArrVal_1525 Int)) (let ((.cse1 (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525)))) (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (<= 0 (+ (select .cse1 .cse2) 4)))))) (forall ((v_ArrVal_1530 (Array Int Int))) (= (select (select (store .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) (forall ((v_ArrVal_1525 Int)) (let ((.cse8 (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525)))) (store .cse9 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (not (<= .cse7 0)) (= .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|) (not (<= 0 .cse7)) (<= 0 (+ (select .cse8 .cse2) 4)))))) (forall ((v_ArrVal_1525 Int)) (let ((.cse11 (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525)))) (store .cse12 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (not (<= .cse10 0)) (= .cse10 |c_ULTIMATE.start_main_~data~0#1.offset|) (not (<= 0 .cse10)) (forall ((v_ArrVal_1530 (Array Int Int))) (<= (+ (select .cse11 .cse2) 8) (select |c_#length| (select (select (store .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1525 Int)) (let ((.cse15 (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525)))) (store .cse16 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse4 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (not (<= .cse13 0)) (forall ((v_ArrVal_1530 (Array Int Int))) (let ((.cse14 (select (store .cse6 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse14 |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|) (<= (+ (select .cse15 .cse2) 8) (select |c_#length| (select .cse14 .cse2)))))) (not (<= 0 .cse13)))))))) is different from false [2023-02-16 03:17:13,241 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4))) (and (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1525 Int)) (let ((.cse1 (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1523))) (store .cse7 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525))))) (store .cse5 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (not (<= 0 .cse0)) (not (<= .cse0 0)) (forall ((v_ArrVal_1530 (Array Int Int))) (let ((.cse3 (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1522))) (store .cse4 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (<= (+ (select .cse1 .cse2) 8) (select |c_#length| (select .cse3 .cse2))) (= (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|)))))))) (or (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1525 Int)) (let ((.cse8 (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1523))) (store .cse11 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525))))) (store .cse10 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (<= 0 (+ (select .cse8 .cse2) 4)) (not (<= 0 .cse9)) (not (<= .cse9 0)))))) (forall ((v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= (select (select (store (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1522))) (store .cse12 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1525 Int)) (let ((.cse14 (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1523))) (store .cse17 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525))))) (store .cse16 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~data~0#1.offset|) (not (<= 0 .cse13)) (not (<= .cse13 0)) (forall ((v_ArrVal_1530 (Array Int Int))) (<= (+ (select .cse14 .cse2) 8) (select |c_#length| (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1522))) (store .cse15 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1530) |c_ULTIMATE.start_main_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1525 Int)) (let ((.cse19 (select (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1523))) (store .cse21 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1525))))) (store .cse20 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= .cse18 |c_ULTIMATE.start_main_~data~0#1.offset|) (<= 0 (+ (select .cse19 .cse2) 4)) (not (<= 0 .cse18)) (not (<= .cse18 0)))))))) is different from false [2023-02-16 03:17:30,955 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 93 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:17:31,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:31,142 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 292 treesize of output 182 [2023-02-16 03:17:31,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:31,151 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 50 treesize of output 41 [2023-02-16 03:17:31,159 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 224 treesize of output 218 [2023-02-16 03:17:31,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:17:31,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:31,179 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 1784 treesize of output 1770 [2023-02-16 03:17:31,191 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 1918 treesize of output 1806 [2023-02-16 03:17:31,201 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 1816 treesize of output 1792 [2023-02-16 03:17:31,212 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 214 treesize of output 198 [2023-02-16 03:17:31,231 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 8 treesize of output 4 [2023-02-16 03:17:32,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:32,550 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 1204 treesize of output 1204 [2023-02-16 03:17:35,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:35,720 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 156 treesize of output 147 [2023-02-16 03:17:35,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:35,726 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 424 treesize of output 274 [2023-02-16 03:17:35,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:35,743 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 650 treesize of output 649 [2023-02-16 03:17:35,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:17:35,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:17:35,776 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 10085 treesize of output 9983 [2023-02-16 03:17:35,789 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 8374 treesize of output 7862 [2023-02-16 03:17:35,803 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 11435 treesize of output 10747 [2023-02-16 03:17:35,816 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 11025 treesize of output 10833 [2023-02-16 03:17:35,833 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 9070 treesize of output 8702 [2023-02-16 03:17:35,852 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 4442 treesize of output 4258 [2023-02-16 03:17:35,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 8 treesize of output 4