./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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-ext/tree_of_cslls.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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:43:05,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:43:05,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:43:05,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:43:05,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:43:05,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:43:05,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:43:05,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:43:05,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:43:05,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:43:05,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:43:05,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:43:05,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:43:05,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:43:05,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:43:05,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:43:05,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:43:05,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:43:05,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:43:05,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:43:05,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:43:05,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:43:05,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:43:05,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:43:05,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:43:05,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:43:05,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:43:05,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:43:05,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:43:05,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:43:05,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:43:05,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:43:05,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:43:05,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:43:05,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:43:05,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:43:05,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:43:05,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:43:05,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:43:05,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:43:05,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:43:05,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:43:05,988 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:43:06,003 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:43:06,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:43:06,004 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:43:06,004 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:43:06,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:43:06,005 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:43:06,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:43:06,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:43:06,006 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:43:06,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:43:06,007 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:43:06,008 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:43:06,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:43:06,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:43:06,008 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:43:06,008 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:43:06,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:43:06,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:43:06,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:43:06,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:43:06,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:43:06,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:43:06,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:43:06,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:43:06,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2022-07-20 05:43:06,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:43:06,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:43:06,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:43:06,194 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:43:06,195 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:43:06,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-07-20 05:43:06,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f287b20/8fd9d8ad87b64131a9737df2fbba7f0d/FLAG678d1282b [2022-07-20 05:43:06,645 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:43:06,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-07-20 05:43:06,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f287b20/8fd9d8ad87b64131a9737df2fbba7f0d/FLAG678d1282b [2022-07-20 05:43:07,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f287b20/8fd9d8ad87b64131a9737df2fbba7f0d [2022-07-20 05:43:07,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:43:07,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:43:07,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:43:07,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:43:07,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:43:07,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc96c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07, skipping insertion in model container [2022-07-20 05:43:07,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:43:07,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:43:07,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:43:07,285 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:43:07,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:43:07,354 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:43:07,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07 WrapperNode [2022-07-20 05:43:07,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:43:07,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:43:07,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:43:07,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:43:07,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,398 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-07-20 05:43:07,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:43:07,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:43:07,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:43:07,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:43:07,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:43:07,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:43:07,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:43:07,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:43:07,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (1/1) ... [2022-07-20 05:43:07,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:43:07,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:07,475 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) [2022-07-20 05:43:07,477 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 [2022-07-20 05:43:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:43:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:43:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:43:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:43:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:43:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:43:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:43:07,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:43:07,606 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:43:07,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:43:07,965 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:43:07,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:43:07,974 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-20 05:43:07,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:07 BoogieIcfgContainer [2022-07-20 05:43:07,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:43:07,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:43:07,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:43:07,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:43:07,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:43:07" (1/3) ... [2022-07-20 05:43:07,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd31bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:07, skipping insertion in model container [2022-07-20 05:43:07,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:07" (2/3) ... [2022-07-20 05:43:07,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd31bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:07, skipping insertion in model container [2022-07-20 05:43:07,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:07" (3/3) ... [2022-07-20 05:43:07,983 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2022-07-20 05:43:07,998 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:43:07,998 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-07-20 05:43:08,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:43:08,040 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53ebc1fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23200ed4 [2022-07-20 05:43:08,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-07-20 05:43:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:43:08,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:08,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:43:08,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:43:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:08,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623363360] [2022-07-20 05:43:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:08,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:08,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623363360] [2022-07-20 05:43:08,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623363360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:08,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:08,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:43:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995163506] [2022-07-20 05:43:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:08,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:08,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:08,185 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:08,393 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2022-07-20 05:43:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 05:43:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:08,402 INFO L225 Difference]: With dead ends: 282 [2022-07-20 05:43:08,403 INFO L226 Difference]: Without dead ends: 278 [2022-07-20 05:43:08,404 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 [2022-07-20 05:43:08,406 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:08,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-20 05:43:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2022-07-20 05:43:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2022-07-20 05:43:08,435 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2022-07-20 05:43:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:08,435 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2022-07-20 05:43:08,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2022-07-20 05:43:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:43:08,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:08,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:43:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:43:08,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:43:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:08,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383168308] [2022-07-20 05:43:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:08,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383168308] [2022-07-20 05:43:08,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383168308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:08,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:08,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:43:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907974688] [2022-07-20 05:43:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:08,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:08,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:08,467 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:08,572 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2022-07-20 05:43:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 05:43:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:08,574 INFO L225 Difference]: With dead ends: 197 [2022-07-20 05:43:08,574 INFO L226 Difference]: Without dead ends: 197 [2022-07-20 05:43:08,574 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 [2022-07-20 05:43:08,575 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:08,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:43:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-20 05:43:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-07-20 05:43:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2022-07-20 05:43:08,582 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2022-07-20 05:43:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:08,582 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2022-07-20 05:43:08,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-07-20 05:43:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:43:08,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:08,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:43:08,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:43:08,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-07-20 05:43:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:08,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734985385] [2022-07-20 05:43:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734985385] [2022-07-20 05:43:08,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734985385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:08,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:08,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:08,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632063021] [2022-07-20 05:43:08,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:08,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:43:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:08,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:43:08,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:43:08,649 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-20 05:43:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:08,910 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2022-07-20 05:43:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:43:08,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 [2022-07-20 05:43:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:08,912 INFO L225 Difference]: With dead ends: 354 [2022-07-20 05:43:08,912 INFO L226 Difference]: Without dead ends: 354 [2022-07-20 05:43:08,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:43:08,914 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:08,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-07-20 05:43:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2022-07-20 05:43:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 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) [2022-07-20 05:43:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2022-07-20 05:43:08,933 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2022-07-20 05:43:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:08,934 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2022-07-20 05:43:08,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-07-20 05:43:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2022-07-20 05:43:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:43:08,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:08,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:08,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:43:08,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2022-07-20 05:43:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701680996] [2022-07-20 05:43:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:08,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701680996] [2022-07-20 05:43:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701680996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:08,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:08,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106806647] [2022-07-20 05:43:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:08,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:08,980 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:09,153 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-07-20 05:43:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:43:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:43:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:09,154 INFO L225 Difference]: With dead ends: 189 [2022-07-20 05:43:09,154 INFO L226 Difference]: Without dead ends: 189 [2022-07-20 05:43:09,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:09,156 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:09,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-20 05:43:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-07-20 05:43:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 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) [2022-07-20 05:43:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-07-20 05:43:09,160 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2022-07-20 05:43:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:09,160 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-07-20 05:43:09,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-07-20 05:43:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:43:09,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:09,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:43:09,162 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2022-07-20 05:43:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087735562] [2022-07-20 05:43:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:09,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087735562] [2022-07-20 05:43:09,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087735562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:09,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:09,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391189001] [2022-07-20 05:43:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:09,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:09,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:09,214 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:09,378 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-07-20 05:43:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:43:09,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:43:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:09,379 INFO L225 Difference]: With dead ends: 188 [2022-07-20 05:43:09,379 INFO L226 Difference]: Without dead ends: 188 [2022-07-20 05:43:09,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:09,380 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:09,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:43:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-20 05:43:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-20 05:43:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 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) [2022-07-20 05:43:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2022-07-20 05:43:09,384 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2022-07-20 05:43:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:09,384 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2022-07-20 05:43:09,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-07-20 05:43:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:43:09,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:09,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:09,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:43:09,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2022-07-20 05:43:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:09,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394967615] [2022-07-20 05:43:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:09,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394967615] [2022-07-20 05:43:09,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394967615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:09,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:09,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:43:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349733364] [2022-07-20 05:43:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:09,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:43:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:43:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:43:09,470 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:09,837 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2022-07-20 05:43:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:43:09,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 05:43:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:09,839 INFO L225 Difference]: With dead ends: 353 [2022-07-20 05:43:09,839 INFO L226 Difference]: Without dead ends: 353 [2022-07-20 05:43:09,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:43:09,842 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 470 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:09,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 675 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:43:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-20 05:43:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2022-07-20 05:43:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 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) [2022-07-20 05:43:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2022-07-20 05:43:09,849 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2022-07-20 05:43:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:09,850 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2022-07-20 05:43:09,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2022-07-20 05:43:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:43:09,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:09,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:09,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:43:09,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2022-07-20 05:43:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:09,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906195833] [2022-07-20 05:43:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:09,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906195833] [2022-07-20 05:43:09,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906195833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:09,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:09,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:43:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841714444] [2022-07-20 05:43:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:43:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:43:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:43:09,949 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:10,362 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-07-20 05:43:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:43:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 05:43:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:10,364 INFO L225 Difference]: With dead ends: 347 [2022-07-20 05:43:10,364 INFO L226 Difference]: Without dead ends: 347 [2022-07-20 05:43:10,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:43:10,364 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:10,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:43:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-20 05:43:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2022-07-20 05:43:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 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) [2022-07-20 05:43:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2022-07-20 05:43:10,378 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2022-07-20 05:43:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:10,379 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2022-07-20 05:43:10,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2022-07-20 05:43:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:43:10,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:10,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:10,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:43:10,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2022-07-20 05:43:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:10,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733304941] [2022-07-20 05:43:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:10,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733304941] [2022-07-20 05:43:10,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733304941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:10,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:10,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:43:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961663630] [2022-07-20 05:43:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:10,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:10,423 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:10,561 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2022-07-20 05:43:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:10,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:43:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:10,563 INFO L225 Difference]: With dead ends: 316 [2022-07-20 05:43:10,563 INFO L226 Difference]: Without dead ends: 316 [2022-07-20 05:43:10,564 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 [2022-07-20 05:43:10,564 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:10,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:43:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-20 05:43:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2022-07-20 05:43:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 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) [2022-07-20 05:43:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2022-07-20 05:43:10,570 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2022-07-20 05:43:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:10,571 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2022-07-20 05:43:10,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2022-07-20 05:43:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:43:10,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:10,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:10,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:43:10,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2022-07-20 05:43:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:10,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775340207] [2022-07-20 05:43:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:10,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775340207] [2022-07-20 05:43:10,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775340207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:10,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:10,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:43:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533996028] [2022-07-20 05:43:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:10,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:10,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:10,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:10,631 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:10,766 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2022-07-20 05:43:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:43:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:10,768 INFO L225 Difference]: With dead ends: 293 [2022-07-20 05:43:10,768 INFO L226 Difference]: Without dead ends: 293 [2022-07-20 05:43:10,768 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 [2022-07-20 05:43:10,768 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:10,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:43:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-20 05:43:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2022-07-20 05:43:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 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) [2022-07-20 05:43:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-07-20 05:43:10,771 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2022-07-20 05:43:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:10,772 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-07-20 05:43:10,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-07-20 05:43:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:43:10,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:10,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:10,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:43:10,772 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2022-07-20 05:43:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:10,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183969060] [2022-07-20 05:43:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183969060] [2022-07-20 05:43:10,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183969060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:10,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:10,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999956947] [2022-07-20 05:43:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:10,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:43:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:10,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:43:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:43:10,819 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:11,006 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2022-07-20 05:43:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:43:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:43:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:11,007 INFO L225 Difference]: With dead ends: 254 [2022-07-20 05:43:11,007 INFO L226 Difference]: Without dead ends: 254 [2022-07-20 05:43:11,008 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 [2022-07-20 05:43:11,008 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:11,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-20 05:43:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2022-07-20 05:43:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2022-07-20 05:43:11,012 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2022-07-20 05:43:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:11,013 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2022-07-20 05:43:11,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2022-07-20 05:43:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:43:11,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:11,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:11,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:43:11,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2022-07-20 05:43:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:11,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159964067] [2022-07-20 05:43:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:11,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159964067] [2022-07-20 05:43:11,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159964067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:11,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:11,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130819662] [2022-07-20 05:43:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:11,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:11,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:11,059 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:11,339 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2022-07-20 05:43:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:43:11,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:43:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:11,341 INFO L225 Difference]: With dead ends: 438 [2022-07-20 05:43:11,341 INFO L226 Difference]: Without dead ends: 438 [2022-07-20 05:43:11,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:11,341 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:11,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:43:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-20 05:43:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2022-07-20 05:43:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2022-07-20 05:43:11,347 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2022-07-20 05:43:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:11,348 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2022-07-20 05:43:11,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2022-07-20 05:43:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:43:11,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:11,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:11,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:43:11,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:11,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2022-07-20 05:43:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:11,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891457970] [2022-07-20 05:43:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891457970] [2022-07-20 05:43:11,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891457970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:11,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:11,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:43:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495867554] [2022-07-20 05:43:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:11,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:43:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:43:11,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:43:11,422 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:11,846 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2022-07-20 05:43:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:43:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:43:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:11,849 INFO L225 Difference]: With dead ends: 784 [2022-07-20 05:43:11,849 INFO L226 Difference]: Without dead ends: 784 [2022-07-20 05:43:11,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:43:11,850 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 363 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:11,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1218 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:43:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-20 05:43:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2022-07-20 05:43:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2022-07-20 05:43:11,857 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2022-07-20 05:43:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:11,857 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2022-07-20 05:43:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2022-07-20 05:43:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:43:11,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:11,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:11,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:43:11,859 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2022-07-20 05:43:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:11,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643063939] [2022-07-20 05:43:11,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:11,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643063939] [2022-07-20 05:43:12,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643063939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:12,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:12,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:43:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981174887] [2022-07-20 05:43:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:12,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:43:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:43:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:43:12,034 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:12,557 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2022-07-20 05:43:12,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:43:12,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:43:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:12,560 INFO L225 Difference]: With dead ends: 603 [2022-07-20 05:43:12,560 INFO L226 Difference]: Without dead ends: 603 [2022-07-20 05:43:12,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:43:12,562 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 392 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:12,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 926 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:43:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-07-20 05:43:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2022-07-20 05:43:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2022-07-20 05:43:12,569 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2022-07-20 05:43:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:12,569 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2022-07-20 05:43:12,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2022-07-20 05:43:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:43:12,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:12,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:12,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:43:12,573 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2022-07-20 05:43:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:12,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875539838] [2022-07-20 05:43:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:12,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875539838] [2022-07-20 05:43:12,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875539838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:12,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:12,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172492279] [2022-07-20 05:43:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:12,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:12,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:12,601 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:12,612 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2022-07-20 05:43:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:43:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:12,614 INFO L225 Difference]: With dead ends: 395 [2022-07-20 05:43:12,614 INFO L226 Difference]: Without dead ends: 395 [2022-07-20 05:43:12,614 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 [2022-07-20 05:43:12,615 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:12,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:43:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-20 05:43:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2022-07-20 05:43:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2022-07-20 05:43:12,620 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2022-07-20 05:43:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:12,621 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2022-07-20 05:43:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2022-07-20 05:43:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:43:12,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:12,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:12,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:43:12,622 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2022-07-20 05:43:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:12,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234006724] [2022-07-20 05:43:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:12,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234006724] [2022-07-20 05:43:12,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234006724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:12,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:12,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667658220] [2022-07-20 05:43:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:12,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:12,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:12,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:12,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:12,650 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2022-07-20 05:43:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:12,655 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2022-07-20 05:43:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 [2022-07-20 05:43:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:12,657 INFO L225 Difference]: With dead ends: 365 [2022-07-20 05:43:12,657 INFO L226 Difference]: Without dead ends: 365 [2022-07-20 05:43:12,658 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 [2022-07-20 05:43:12,659 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:12,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:43:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-20 05:43:12,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-07-20 05:43:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2022-07-20 05:43:12,664 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2022-07-20 05:43:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:12,664 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2022-07-20 05:43:12,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) [2022-07-20 05:43:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2022-07-20 05:43:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:43:12,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:12,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:12,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:43:12,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2022-07-20 05:43:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:12,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741315055] [2022-07-20 05:43:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:12,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741315055] [2022-07-20 05:43:12,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741315055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:12,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399502572] [2022-07-20 05:43:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:12,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:12,798 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) [2022-07-20 05:43:12,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:43:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:12,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:43:12,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:12,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:12,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:12,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:12,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:43:12,984 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:12,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-07-20 05:43:13,003 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:43:13,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:13,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-07-20 05:43:13,161 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:13,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 05:43:13,226 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-20 05:43:13,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 45 [2022-07-20 05:43:13,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 05:43:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:13,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:13,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462)) (.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 .cse2) 1)))))) is different from false [2022-07-20 05:43:13,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:13,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 90 treesize of output 70 [2022-07-20 05:43:13,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:13,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 380 treesize of output 320 [2022-07-20 05:43:13,685 INFO L356 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2022-07-20 05:43:13,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 851 treesize of output 821 [2022-07-20 05:43:13,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 653 treesize of output 565 [2022-07-20 05:43:13,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 577 treesize of output 449 [2022-07-20 05:43:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:14,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399502572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:14,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:14,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2022-07-20 05:43:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220465664] [2022-07-20 05:43:14,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:14,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 05:43:14,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:14,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 05:43:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=526, Unknown=6, NotChecked=48, Total=702 [2022-07-20 05:43:14,964 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:15,240 INFO L93 Difference]: Finished difference Result 459 states and 657 transitions. [2022-07-20 05:43:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:43:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:43:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:15,241 INFO L225 Difference]: With dead ends: 459 [2022-07-20 05:43:15,241 INFO L226 Difference]: Without dead ends: 459 [2022-07-20 05:43:15,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=774, Unknown=6, NotChecked=60, Total=1056 [2022-07-20 05:43:15,242 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 186 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 488 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:15,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1361 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 488 Unchecked, 0.2s Time] [2022-07-20 05:43:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-20 05:43:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2022-07-20 05:43:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2022-07-20 05:43:15,247 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2022-07-20 05:43:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:15,247 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2022-07-20 05:43:15,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2022-07-20 05:43:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:43:15,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:15,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:15,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:43:15,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-20 05:43:15,465 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:15,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2022-07-20 05:43:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:15,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155690320] [2022-07-20 05:43:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155690320] [2022-07-20 05:43:15,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155690320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009225737] [2022-07-20 05:43:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:15,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:15,779 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) [2022-07-20 05:43:15,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:43:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:15,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 05:43:15,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:15,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:15,916 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:15,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:15,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:43:15,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:43:15,981 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:15,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 36 [2022-07-20 05:43:15,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:43:15,999 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:15,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:16,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-20 05:43:16,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:43:16,120 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:16,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 54 [2022-07-20 05:43:16,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:43:16,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:16,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2022-07-20 05:43:16,151 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:43:16,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-20 05:43:16,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 05:43:16,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:43:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:16,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:16,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)) (and (forall ((v_ArrVal_564 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))))) is different from false [2022-07-20 05:43:16,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) .cse0 v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store .cse2 .cse0 v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))) is different from false [2022-07-20 05:43:16,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:16,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 162 [2022-07-20 05:43:16,468 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:43:16,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:43:16,517 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false [2022-07-20 05:43:16,528 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2022-07-20 05:43:16,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_1) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (= (select (select (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)))) is different from false [2022-07-20 05:43:19,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:19,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 50 [2022-07-20 05:43:19,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 244 treesize of output 190 [2022-07-20 05:43:19,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 141 treesize of output 109 [2022-07-20 05:43:19,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 93 [2022-07-20 05:43:19,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:19,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 51 [2022-07-20 05:43:19,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:19,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 41 [2022-07-20 05:43:19,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 23 [2022-07-20 05:43:19,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-07-20 05:43:19,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:19,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 51 [2022-07-20 05:43:19,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:19,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 41 [2022-07-20 05:43:19,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 23 [2022-07-20 05:43:19,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:19,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-07-20 05:43:19,212 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:43:19,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:43:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:43:19,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009225737] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:19,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:19,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 36 [2022-07-20 05:43:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078617044] [2022-07-20 05:43:19,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 05:43:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 05:43:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=859, Unknown=14, NotChecked=320, Total=1332 [2022-07-20 05:43:19,324 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:26,987 INFO L93 Difference]: Finished difference Result 1105 states and 1577 transitions. [2022-07-20 05:43:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:43:26,988 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:43:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:26,992 INFO L225 Difference]: With dead ends: 1105 [2022-07-20 05:43:26,992 INFO L226 Difference]: Without dead ends: 1105 [2022-07-20 05:43:26,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=330, Invalid=1653, Unknown=17, NotChecked=450, Total=2450 [2022-07-20 05:43:26,993 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1298 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 5196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3184 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:26,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2436 Invalid, 5196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1948 Invalid, 0 Unknown, 3184 Unchecked, 3.7s Time] [2022-07-20 05:43:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2022-07-20 05:43:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 363. [2022-07-20 05:43:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 302 states have (on average 1.7549668874172186) internal successors, (530), 362 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 530 transitions. [2022-07-20 05:43:27,003 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 530 transitions. Word has length 24 [2022-07-20 05:43:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:27,003 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 530 transitions. [2022-07-20 05:43:27,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 530 transitions. [2022-07-20 05:43:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:43:27,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:27,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:27,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:43:27,204 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,SelfDestructingSolverStorable16 [2022-07-20 05:43:27,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash -354718400, now seen corresponding path program 1 times [2022-07-20 05:43:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:27,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229117441] [2022-07-20 05:43:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:27,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229117441] [2022-07-20 05:43:27,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229117441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:27,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:27,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5074612] [2022-07-20 05:43:27,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:27,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:27,238 INFO L87 Difference]: Start difference. First operand 363 states and 530 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:27,266 INFO L93 Difference]: Finished difference Result 366 states and 533 transitions. [2022-07-20 05:43:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:43:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:27,268 INFO L225 Difference]: With dead ends: 366 [2022-07-20 05:43:27,268 INFO L226 Difference]: Without dead ends: 366 [2022-07-20 05:43:27,268 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 [2022-07-20 05:43:27,268 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:27,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:43:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-20 05:43:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-20 05:43:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 305 states have (on average 1.7475409836065574) internal successors, (533), 365 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 533 transitions. [2022-07-20 05:43:27,274 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 533 transitions. Word has length 24 [2022-07-20 05:43:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:27,274 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 533 transitions. [2022-07-20 05:43:27,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 533 transitions. [2022-07-20 05:43:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:43:27,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:27,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:27,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 05:43:27,275 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:27,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1183191976, now seen corresponding path program 1 times [2022-07-20 05:43:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:27,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308394673] [2022-07-20 05:43:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:27,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:27,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308394673] [2022-07-20 05:43:27,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308394673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:27,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:27,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40550707] [2022-07-20 05:43:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:27,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:27,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:27,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:27,326 INFO L87 Difference]: Start difference. First operand 366 states and 533 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:27,360 INFO L93 Difference]: Finished difference Result 409 states and 562 transitions. [2022-07-20 05:43:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:27,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-07-20 05:43:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:27,362 INFO L225 Difference]: With dead ends: 409 [2022-07-20 05:43:27,362 INFO L226 Difference]: Without dead ends: 409 [2022-07-20 05:43:27,362 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 [2022-07-20 05:43:27,362 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 52 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:27,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 351 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:43:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-20 05:43:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 355. [2022-07-20 05:43:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 294 states have (on average 1.7312925170068028) internal successors, (509), 354 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 509 transitions. [2022-07-20 05:43:27,366 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 509 transitions. Word has length 25 [2022-07-20 05:43:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:27,367 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 509 transitions. [2022-07-20 05:43:27,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 509 transitions. [2022-07-20 05:43:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:43:27,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:27,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:27,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 05:43:27,367 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 808555227, now seen corresponding path program 1 times [2022-07-20 05:43:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:27,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550634634] [2022-07-20 05:43:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:27,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550634634] [2022-07-20 05:43:27,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550634634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:27,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:27,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:43:27,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420420690] [2022-07-20 05:43:27,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:27,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:43:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:27,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:43:27,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:43:27,708 INFO L87 Difference]: Start difference. First operand 355 states and 509 transitions. Second operand has 10 states, 10 states have (on average 2.6) 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) [2022-07-20 05:43:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:29,391 INFO L93 Difference]: Finished difference Result 615 states and 802 transitions. [2022-07-20 05:43:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:43:29,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) 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 [2022-07-20 05:43:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:29,393 INFO L225 Difference]: With dead ends: 615 [2022-07-20 05:43:29,393 INFO L226 Difference]: Without dead ends: 615 [2022-07-20 05:43:29,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:43:29,394 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 584 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:29,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1034 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 05:43:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-20 05:43:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 440. [2022-07-20 05:43:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 379 states have (on average 1.7097625329815302) internal successors, (648), 439 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 648 transitions. [2022-07-20 05:43:29,399 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 648 transitions. Word has length 26 [2022-07-20 05:43:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:29,399 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 648 transitions. [2022-07-20 05:43:29,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) 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) [2022-07-20 05:43:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 648 transitions. [2022-07-20 05:43:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:43:29,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:29,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:29,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 05:43:29,400 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:29,400 INFO L85 PathProgramCache]: Analyzing trace with hash -645242845, now seen corresponding path program 1 times [2022-07-20 05:43:29,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:29,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220532163] [2022-07-20 05:43:29,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:29,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:29,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220532163] [2022-07-20 05:43:29,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220532163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:29,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:29,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:43:29,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684562009] [2022-07-20 05:43:29,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:29,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:43:29,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:29,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:43:29,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:43:29,717 INFO L87 Difference]: Start difference. First operand 440 states and 648 transitions. Second operand has 10 states, 10 states have (on average 2.6) 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) [2022-07-20 05:43:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:31,328 INFO L93 Difference]: Finished difference Result 575 states and 752 transitions. [2022-07-20 05:43:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:43:31,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) 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 [2022-07-20 05:43:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:31,330 INFO L225 Difference]: With dead ends: 575 [2022-07-20 05:43:31,330 INFO L226 Difference]: Without dead ends: 575 [2022-07-20 05:43:31,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:43:31,331 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 371 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:31,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1138 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 05:43:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-07-20 05:43:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 413. [2022-07-20 05:43:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 352 states have (on average 1.7159090909090908) internal successors, (604), 412 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 604 transitions. [2022-07-20 05:43:31,338 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 604 transitions. Word has length 26 [2022-07-20 05:43:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:31,338 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 604 transitions. [2022-07-20 05:43:31,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) 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) [2022-07-20 05:43:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 604 transitions. [2022-07-20 05:43:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:43:31,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:31,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:31,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 05:43:31,339 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310097, now seen corresponding path program 1 times [2022-07-20 05:43:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117660340] [2022-07-20 05:43:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:31,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:31,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117660340] [2022-07-20 05:43:31,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117660340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:31,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:31,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:43:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974615396] [2022-07-20 05:43:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:31,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:43:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:43:31,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:43:31,626 INFO L87 Difference]: Start difference. First operand 413 states and 604 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2022-07-20 05:43:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:33,449 INFO L93 Difference]: Finished difference Result 614 states and 871 transitions. [2022-07-20 05:43:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:43:33,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 [2022-07-20 05:43:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:33,452 INFO L225 Difference]: With dead ends: 614 [2022-07-20 05:43:33,452 INFO L226 Difference]: Without dead ends: 614 [2022-07-20 05:43:33,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:43:33,452 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 509 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:33,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 877 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-20 05:43:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-20 05:43:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 422. [2022-07-20 05:43:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.703601108033241) internal successors, (615), 421 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 615 transitions. [2022-07-20 05:43:33,459 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 615 transitions. Word has length 27 [2022-07-20 05:43:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:33,460 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 615 transitions. [2022-07-20 05:43:33,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2022-07-20 05:43:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 615 transitions. [2022-07-20 05:43:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:43:33,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:33,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 05:43:33,460 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310096, now seen corresponding path program 1 times [2022-07-20 05:43:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711425052] [2022-07-20 05:43:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711425052] [2022-07-20 05:43:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711425052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:33,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:43:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120197785] [2022-07-20 05:43:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:43:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:43:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:43:33,808 INFO L87 Difference]: Start difference. First operand 422 states and 615 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2022-07-20 05:43:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:35,992 INFO L93 Difference]: Finished difference Result 617 states and 874 transitions. [2022-07-20 05:43:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:43:35,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 [2022-07-20 05:43:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:35,994 INFO L225 Difference]: With dead ends: 617 [2022-07-20 05:43:35,994 INFO L226 Difference]: Without dead ends: 617 [2022-07-20 05:43:35,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:43:35,995 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 572 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:35,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 649 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 05:43:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-20 05:43:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2022-07-20 05:43:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.700831024930748) internal successors, (614), 421 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 614 transitions. [2022-07-20 05:43:36,000 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 614 transitions. Word has length 27 [2022-07-20 05:43:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:36,001 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 614 transitions. [2022-07-20 05:43:36,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2022-07-20 05:43:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 614 transitions. [2022-07-20 05:43:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:43:36,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:36,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:36,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 05:43:36,002 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -114590158, now seen corresponding path program 1 times [2022-07-20 05:43:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948136895] [2022-07-20 05:43:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:36,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948136895] [2022-07-20 05:43:36,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948136895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:36,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:36,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449359624] [2022-07-20 05:43:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:36,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:36,030 INFO L87 Difference]: Start difference. First operand 422 states and 614 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-07-20 05:43:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:36,044 INFO L93 Difference]: Finished difference Result 426 states and 618 transitions. [2022-07-20 05:43:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 [2022-07-20 05:43:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:36,046 INFO L225 Difference]: With dead ends: 426 [2022-07-20 05:43:36,046 INFO L226 Difference]: Without dead ends: 426 [2022-07-20 05:43:36,046 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 [2022-07-20 05:43:36,047 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:36,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:43:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-07-20 05:43:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-07-20 05:43:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 365 states have (on average 1.6931506849315068) internal successors, (618), 425 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 618 transitions. [2022-07-20 05:43:36,052 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 618 transitions. Word has length 27 [2022-07-20 05:43:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:36,052 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 618 transitions. [2022-07-20 05:43:36,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-07-20 05:43:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 618 transitions. [2022-07-20 05:43:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:43:36,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:36,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:36,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 05:43:36,053 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash -114649740, now seen corresponding path program 1 times [2022-07-20 05:43:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:36,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79613109] [2022-07-20 05:43:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:36,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79613109] [2022-07-20 05:43:36,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79613109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:36,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:36,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:43:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731718873] [2022-07-20 05:43:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:36,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:36,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:36,081 INFO L87 Difference]: Start difference. First operand 426 states and 618 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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) [2022-07-20 05:43:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:36,334 INFO L93 Difference]: Finished difference Result 628 states and 919 transitions. [2022-07-20 05:43:36,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:36,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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 [2022-07-20 05:43:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:36,336 INFO L225 Difference]: With dead ends: 628 [2022-07-20 05:43:36,336 INFO L226 Difference]: Without dead ends: 628 [2022-07-20 05:43:36,336 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 [2022-07-20 05:43:36,337 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:36,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 301 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-07-20 05:43:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 421. [2022-07-20 05:43:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 365 states have (on average 1.6794520547945206) internal successors, (613), 420 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 613 transitions. [2022-07-20 05:43:36,342 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 613 transitions. Word has length 27 [2022-07-20 05:43:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:36,345 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 613 transitions. [2022-07-20 05:43:36,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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) [2022-07-20 05:43:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 613 transitions. [2022-07-20 05:43:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:43:36,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:36,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:36,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 05:43:36,346 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -114649739, now seen corresponding path program 1 times [2022-07-20 05:43:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:36,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107648313] [2022-07-20 05:43:36,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:36,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:36,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107648313] [2022-07-20 05:43:36,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107648313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:36,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:36,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:43:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032877216] [2022-07-20 05:43:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:36,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:43:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:36,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:43:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:43:36,410 INFO L87 Difference]: Start difference. First operand 421 states and 613 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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) [2022-07-20 05:43:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:36,571 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2022-07-20 05:43:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:43:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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 [2022-07-20 05:43:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:36,572 INFO L225 Difference]: With dead ends: 419 [2022-07-20 05:43:36,572 INFO L226 Difference]: Without dead ends: 419 [2022-07-20 05:43:36,573 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 [2022-07-20 05:43:36,573 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:36,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 253 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-20 05:43:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2022-07-20 05:43:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 365 states have (on average 1.673972602739726) internal successors, (611), 418 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 611 transitions. [2022-07-20 05:43:36,578 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 611 transitions. Word has length 27 [2022-07-20 05:43:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:36,578 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 611 transitions. [2022-07-20 05:43:36,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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) [2022-07-20 05:43:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 611 transitions. [2022-07-20 05:43:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:43:36,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:36,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:36,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 05:43:36,578 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash -127169272, now seen corresponding path program 1 times [2022-07-20 05:43:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:36,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962824058] [2022-07-20 05:43:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:36,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962824058] [2022-07-20 05:43:36,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962824058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898734609] [2022-07-20 05:43:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:36,796 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) [2022-07-20 05:43:36,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:43:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:36,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:43:36,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:36,976 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:36,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:37,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-07-20 05:43:37,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-20 05:43:37,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 17 [2022-07-20 05:43:37,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-07-20 05:43:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:37,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:37,095 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_942 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))) is different from false [2022-07-20 05:43:37,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:37,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-20 05:43:37,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 16 [2022-07-20 05:43:37,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 4 [2022-07-20 05:43:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 05:43:37,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898734609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:37,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:37,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-07-20 05:43:37,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127623011] [2022-07-20 05:43:37,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:37,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:43:37,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:37,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:43:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2022-07-20 05:43:37,266 INFO L87 Difference]: Start difference. First operand 419 states and 611 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:38,387 INFO L93 Difference]: Finished difference Result 880 states and 1268 transitions. [2022-07-20 05:43:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:43:38,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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 [2022-07-20 05:43:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:38,390 INFO L225 Difference]: With dead ends: 880 [2022-07-20 05:43:38,390 INFO L226 Difference]: Without dead ends: 880 [2022-07-20 05:43:38,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=176, Unknown=2, NotChecked=28, Total=272 [2022-07-20 05:43:38,390 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 332 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:38,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1081 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 777 Invalid, 0 Unknown, 419 Unchecked, 1.0s Time] [2022-07-20 05:43:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-07-20 05:43:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 412. [2022-07-20 05:43:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 359 states have (on average 1.682451253481894) internal successors, (604), 411 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2022-07-20 05:43:38,400 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 28 [2022-07-20 05:43:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:38,400 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2022-07-20 05:43:38,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2022-07-20 05:43:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:43:38,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:38,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:38,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:43:38,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:38,609 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -287836000, now seen corresponding path program 1 times [2022-07-20 05:43:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:38,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866044741] [2022-07-20 05:43:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866044741] [2022-07-20 05:43:38,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866044741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:38,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:43:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278160492] [2022-07-20 05:43:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:38,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:43:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:38,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:43:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:43:38,765 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) [2022-07-20 05:43:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:39,178 INFO L93 Difference]: Finished difference Result 519 states and 766 transitions. [2022-07-20 05:43:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:43:39,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 [2022-07-20 05:43:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:39,180 INFO L225 Difference]: With dead ends: 519 [2022-07-20 05:43:39,180 INFO L226 Difference]: Without dead ends: 519 [2022-07-20 05:43:39,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:43:39,180 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 121 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:39,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 437 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:43:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-20 05:43:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 421. [2022-07-20 05:43:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 368 states have (on average 1.673913043478261) internal successors, (616), 420 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2022-07-20 05:43:39,186 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 28 [2022-07-20 05:43:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:39,186 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2022-07-20 05:43:39,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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) [2022-07-20 05:43:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2022-07-20 05:43:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:43:39,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:39,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 05:43:39,187 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -287651302, now seen corresponding path program 1 times [2022-07-20 05:43:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:39,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765540933] [2022-07-20 05:43:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:39,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765540933] [2022-07-20 05:43:39,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765540933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:39,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:39,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:43:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849618703] [2022-07-20 05:43:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:39,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:43:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:43:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:43:39,465 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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) [2022-07-20 05:43:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:40,776 INFO L93 Difference]: Finished difference Result 547 states and 761 transitions. [2022-07-20 05:43:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:43:40,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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 [2022-07-20 05:43:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:40,778 INFO L225 Difference]: With dead ends: 547 [2022-07-20 05:43:40,778 INFO L226 Difference]: Without dead ends: 547 [2022-07-20 05:43:40,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:43:40,778 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 291 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:40,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 772 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 05:43:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-07-20 05:43:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2022-07-20 05:43:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 327 states have (on average 1.657492354740061) internal successors, (542), 379 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 542 transitions. [2022-07-20 05:43:40,782 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 542 transitions. Word has length 28 [2022-07-20 05:43:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:40,782 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 542 transitions. [2022-07-20 05:43:40,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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) [2022-07-20 05:43:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 542 transitions. [2022-07-20 05:43:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:43:40,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:40,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:40,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 05:43:40,783 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 485465518, now seen corresponding path program 1 times [2022-07-20 05:43:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:40,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740412081] [2022-07-20 05:43:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:41,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740412081] [2022-07-20 05:43:41,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740412081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:41,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:41,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:43:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917495488] [2022-07-20 05:43:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:41,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:43:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:43:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:43:41,019 INFO L87 Difference]: Start difference. First operand 380 states and 542 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:41,824 INFO L93 Difference]: Finished difference Result 546 states and 760 transitions. [2022-07-20 05:43:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:43:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 05:43:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:41,826 INFO L225 Difference]: With dead ends: 546 [2022-07-20 05:43:41,826 INFO L226 Difference]: Without dead ends: 546 [2022-07-20 05:43:41,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:43:41,827 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 407 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:41,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 647 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:43:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-20 05:43:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 383. [2022-07-20 05:43:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 330 states have (on average 1.6545454545454545) internal successors, (546), 382 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 546 transitions. [2022-07-20 05:43:41,837 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 546 transitions. Word has length 30 [2022-07-20 05:43:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:41,837 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 546 transitions. [2022-07-20 05:43:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 546 transitions. [2022-07-20 05:43:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:43:41,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:41,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:41,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 05:43:41,838 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 485466609, now seen corresponding path program 1 times [2022-07-20 05:43:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:41,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792763194] [2022-07-20 05:43:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:41,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792763194] [2022-07-20 05:43:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792763194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:41,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903101790] [2022-07-20 05:43:41,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:41,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:41,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:41,883 INFO L87 Difference]: Start difference. First operand 383 states and 546 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:42,272 INFO L93 Difference]: Finished difference Result 382 states and 542 transitions. [2022-07-20 05:43:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:43:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 05:43:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:42,274 INFO L225 Difference]: With dead ends: 382 [2022-07-20 05:43:42,274 INFO L226 Difference]: Without dead ends: 382 [2022-07-20 05:43:42,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:42,274 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 25 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:42,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 384 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:43:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-20 05:43:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-07-20 05:43:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 330 states have (on average 1.6424242424242423) internal successors, (542), 381 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 542 transitions. [2022-07-20 05:43:42,278 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 542 transitions. Word has length 30 [2022-07-20 05:43:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:42,278 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 542 transitions. [2022-07-20 05:43:42,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 542 transitions. [2022-07-20 05:43:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:43:42,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:42,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:42,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 05:43:42,278 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 485466610, now seen corresponding path program 1 times [2022-07-20 05:43:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:42,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899760795] [2022-07-20 05:43:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:42,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899760795] [2022-07-20 05:43:42,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899760795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:42,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:42,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791952073] [2022-07-20 05:43:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:42,340 INFO L87 Difference]: Start difference. First operand 382 states and 542 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:42,738 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2022-07-20 05:43:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:43:42,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 05:43:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:42,739 INFO L225 Difference]: With dead ends: 381 [2022-07-20 05:43:42,739 INFO L226 Difference]: Without dead ends: 381 [2022-07-20 05:43:42,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:42,740 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:42,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:43:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-20 05:43:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-07-20 05:43:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 330 states have (on average 1.6303030303030304) internal successors, (538), 380 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 538 transitions. [2022-07-20 05:43:42,744 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 538 transitions. Word has length 30 [2022-07-20 05:43:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:42,744 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 538 transitions. [2022-07-20 05:43:42,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 538 transitions. [2022-07-20 05:43:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:43:42,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:42,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:42,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 05:43:42,745 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:42,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1031290720, now seen corresponding path program 1 times [2022-07-20 05:43:42,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:42,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377922959] [2022-07-20 05:43:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:42,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377922959] [2022-07-20 05:43:42,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377922959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:42,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:42,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:42,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647705940] [2022-07-20 05:43:42,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:42,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:43:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:42,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:43:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:43:42,800 INFO L87 Difference]: Start difference. First operand 381 states and 538 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:43,195 INFO L93 Difference]: Finished difference Result 800 states and 1167 transitions. [2022-07-20 05:43:43,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:43:43,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 05:43:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:43,197 INFO L225 Difference]: With dead ends: 800 [2022-07-20 05:43:43,197 INFO L226 Difference]: Without dead ends: 800 [2022-07-20 05:43:43,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:43:43,197 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 198 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:43,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 367 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:43:43,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-07-20 05:43:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 378. [2022-07-20 05:43:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 330 states have (on average 1.621212121212121) internal successors, (535), 377 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 535 transitions. [2022-07-20 05:43:43,202 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 535 transitions. Word has length 30 [2022-07-20 05:43:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:43,202 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 535 transitions. [2022-07-20 05:43:43,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 535 transitions. [2022-07-20 05:43:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:43:43,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:43,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:43,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-20 05:43:43,203 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2130437780, now seen corresponding path program 1 times [2022-07-20 05:43:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:43,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233866133] [2022-07-20 05:43:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:43,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:43,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233866133] [2022-07-20 05:43:43,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233866133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:43,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:43,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:43:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541351313] [2022-07-20 05:43:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:43,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:43:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:43:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:43:43,334 INFO L87 Difference]: Start difference. First operand 378 states and 535 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2022-07-20 05:43:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:44,381 INFO L93 Difference]: Finished difference Result 532 states and 738 transitions. [2022-07-20 05:43:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:43:44,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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 31 [2022-07-20 05:43:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:44,383 INFO L225 Difference]: With dead ends: 532 [2022-07-20 05:43:44,383 INFO L226 Difference]: Without dead ends: 532 [2022-07-20 05:43:44,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:43:44,383 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 251 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:44,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 769 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 05:43:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-20 05:43:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2022-07-20 05:43:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 331 states have (on average 1.6193353474320242) internal successors, (536), 378 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 536 transitions. [2022-07-20 05:43:44,387 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 536 transitions. Word has length 31 [2022-07-20 05:43:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:44,388 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 536 transitions. [2022-07-20 05:43:44,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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) [2022-07-20 05:43:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 536 transitions. [2022-07-20 05:43:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 05:43:44,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:44,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:44,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-20 05:43:44,389 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1619061392, now seen corresponding path program 1 times [2022-07-20 05:43:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:44,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247201355] [2022-07-20 05:43:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247201355] [2022-07-20 05:43:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247201355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392255457] [2022-07-20 05:43:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:44,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:44,436 INFO L87 Difference]: Start difference. First operand 379 states and 536 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:44,770 INFO L93 Difference]: Finished difference Result 378 states and 532 transitions. [2022-07-20 05:43:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:43:44,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 05:43:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:44,771 INFO L225 Difference]: With dead ends: 378 [2022-07-20 05:43:44,771 INFO L226 Difference]: Without dead ends: 378 [2022-07-20 05:43:44,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:44,771 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:44,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:43:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-07-20 05:43:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-07-20 05:43:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.607250755287009) internal successors, (532), 377 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 532 transitions. [2022-07-20 05:43:44,775 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 532 transitions. Word has length 32 [2022-07-20 05:43:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:44,775 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 532 transitions. [2022-07-20 05:43:44,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 532 transitions. [2022-07-20 05:43:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:43:44,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:44,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:44,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-20 05:43:44,776 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121302, now seen corresponding path program 1 times [2022-07-20 05:43:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:44,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123636786] [2022-07-20 05:43:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:45,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123636786] [2022-07-20 05:43:45,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123636786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:45,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:45,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-20 05:43:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98015820] [2022-07-20 05:43:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:45,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:43:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:43:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:43:45,204 INFO L87 Difference]: Start difference. First operand 378 states and 532 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:47,689 INFO L93 Difference]: Finished difference Result 775 states and 1015 transitions. [2022-07-20 05:43:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:43:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 05:43:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:47,691 INFO L225 Difference]: With dead ends: 775 [2022-07-20 05:43:47,692 INFO L226 Difference]: Without dead ends: 775 [2022-07-20 05:43:47,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2022-07-20 05:43:47,692 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 862 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:47,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1520 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 05:43:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-07-20 05:43:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 383. [2022-07-20 05:43:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 336 states have (on average 1.6011904761904763) internal successors, (538), 382 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 538 transitions. [2022-07-20 05:43:47,699 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 538 transitions. Word has length 33 [2022-07-20 05:43:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:47,699 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 538 transitions. [2022-07-20 05:43:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2022-07-20 05:43:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:43:47,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:47,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:47,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-20 05:43:47,700 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:47,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121303, now seen corresponding path program 1 times [2022-07-20 05:43:47,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:47,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077592881] [2022-07-20 05:43:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:47,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077592881] [2022-07-20 05:43:47,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077592881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:47,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:47,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:43:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365260708] [2022-07-20 05:43:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:43:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:43:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:43:47,964 INFO L87 Difference]: Start difference. First operand 383 states and 538 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:49,129 INFO L93 Difference]: Finished difference Result 518 states and 719 transitions. [2022-07-20 05:43:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:43:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 05:43:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:49,131 INFO L225 Difference]: With dead ends: 518 [2022-07-20 05:43:49,131 INFO L226 Difference]: Without dead ends: 518 [2022-07-20 05:43:49,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:43:49,131 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 268 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:49,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 967 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 05:43:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-07-20 05:43:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2022-07-20 05:43:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.6042296072507554) internal successors, (531), 377 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 531 transitions. [2022-07-20 05:43:49,135 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 531 transitions. Word has length 33 [2022-07-20 05:43:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:49,135 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 531 transitions. [2022-07-20 05:43:49,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 531 transitions. [2022-07-20 05:43:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:43:49,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:49,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:49,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-20 05:43:49,136 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1139825358, now seen corresponding path program 1 times [2022-07-20 05:43:49,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:49,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892158114] [2022-07-20 05:43:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:49,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:49,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892158114] [2022-07-20 05:43:49,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892158114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:49,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:49,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:43:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384639168] [2022-07-20 05:43:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:43:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:43:49,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:43:49,219 INFO L87 Difference]: Start difference. First operand 378 states and 531 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:49,573 INFO L93 Difference]: Finished difference Result 535 states and 669 transitions. [2022-07-20 05:43:49,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:43:49,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-20 05:43:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:49,574 INFO L225 Difference]: With dead ends: 535 [2022-07-20 05:43:49,575 INFO L226 Difference]: Without dead ends: 535 [2022-07-20 05:43:49,575 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 [2022-07-20 05:43:49,575 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 326 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:49,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 336 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:43:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-07-20 05:43:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 400. [2022-07-20 05:43:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 353 states have (on average 1.6203966005665722) internal successors, (572), 399 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2022-07-20 05:43:49,579 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 34 [2022-07-20 05:43:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:49,579 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2022-07-20 05:43:49,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2022-07-20 05:43:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:43:49,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:49,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:49,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-20 05:43:49,580 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400092, now seen corresponding path program 1 times [2022-07-20 05:43:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:49,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853979674] [2022-07-20 05:43:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:49,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853979674] [2022-07-20 05:43:49,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853979674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:49,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:49,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479513460] [2022-07-20 05:43:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:49,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:49,649 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:49,919 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2022-07-20 05:43:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:43:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-20 05:43:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:49,921 INFO L225 Difference]: With dead ends: 399 [2022-07-20 05:43:49,921 INFO L226 Difference]: Without dead ends: 399 [2022-07-20 05:43:49,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:49,921 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:49,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 409 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-20 05:43:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2022-07-20 05:43:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 353 states have (on average 1.6175637393767706) internal successors, (571), 398 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 571 transitions. [2022-07-20 05:43:49,926 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 571 transitions. Word has length 34 [2022-07-20 05:43:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:49,927 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 571 transitions. [2022-07-20 05:43:49,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 571 transitions. [2022-07-20 05:43:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:43:49,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:49,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:43:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-20 05:43:49,927 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400093, now seen corresponding path program 1 times [2022-07-20 05:43:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961234577] [2022-07-20 05:43:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:50,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961234577] [2022-07-20 05:43:50,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961234577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:43:50,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:43:50,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:43:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238456970] [2022-07-20 05:43:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:43:50,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:43:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:50,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:43:50,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:43:50,023 INFO L87 Difference]: Start difference. First operand 399 states and 571 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:50,262 INFO L93 Difference]: Finished difference Result 398 states and 570 transitions. [2022-07-20 05:43:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:43:50,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-07-20 05:43:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:50,264 INFO L225 Difference]: With dead ends: 398 [2022-07-20 05:43:50,264 INFO L226 Difference]: Without dead ends: 398 [2022-07-20 05:43:50,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:43:50,264 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:50,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 439 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:43:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-20 05:43:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2022-07-20 05:43:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 353 states have (on average 1.614730878186969) internal successors, (570), 397 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 570 transitions. [2022-07-20 05:43:50,268 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 570 transitions. Word has length 34 [2022-07-20 05:43:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 570 transitions. [2022-07-20 05:43:50,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 570 transitions. [2022-07-20 05:43:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 05:43:50,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:50,268 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, 1, 1] [2022-07-20 05:43:50,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-20 05:43:50,269 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 191313679, now seen corresponding path program 1 times [2022-07-20 05:43:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:50,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120343270] [2022-07-20 05:43:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:50,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120343270] [2022-07-20 05:43:50,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120343270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:50,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189626820] [2022-07-20 05:43:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:50,581 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) [2022-07-20 05:43:50,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:43:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:50,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-20 05:43:50,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:43:50,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:50,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:50,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:50,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:50,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:50,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:50,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:50,892 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:50,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:51,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:51,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:51,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:51,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:43:51,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:51,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:51,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:43:51,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:43:51,237 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:51,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 48 [2022-07-20 05:43:51,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-07-20 05:43:51,401 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:43:51,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:51,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 40 [2022-07-20 05:43:51,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:43:51,827 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:43:51,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 57 [2022-07-20 05:43:51,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-07-20 05:43:52,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-20 05:43:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:52,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:43:52,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-07-20 05:43:52,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1487) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0)) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-07-20 05:43:52,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-07-20 05:43:52,720 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-07-20 05:43:52,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-20 05:43:52,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse0)))) is different from false [2022-07-20 05:43:52,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) .cse0))))) is different from false [2022-07-20 05:43:53,832 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:43:53,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:43:53,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484))) (let ((.cse0 (select (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= .cse0 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|)))))) is different from false [2022-07-20 05:43:54,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484))) (let ((.cse1 (select (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0 0)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse1 0)) (= .cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))))) is different from false [2022-07-20 05:43:54,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4) 0) .cse4 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484))) (let ((.cse0 (select (select (let ((.cse5 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 0) .cse2 0)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 0) .cse2 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= .cse0 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))))) is different from false [2022-07-20 05:43:54,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:43:54,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 75 [2022-07-20 05:43:54,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:54,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 180 [2022-07-20 05:43:54,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 82 [2022-07-20 05:43:54,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 124 [2022-07-20 05:43:54,992 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-07-20 05:43:54,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 195 treesize of output 115 [2022-07-20 05:43:54,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:43:55,005 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-20 05:43:55,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 450 treesize of output 266 [2022-07-20 05:43:55,018 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:43:55,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 18 [2022-07-20 05:43:55,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 05:43:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:55,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189626820] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:43:55,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:43:55,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2022-07-20 05:43:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515957113] [2022-07-20 05:43:55,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:43:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 05:43:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:43:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 05:43:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1170, Unknown=16, NotChecked=616, Total=1980 [2022-07-20 05:43:55,137 INFO L87 Difference]: Start difference. First operand 398 states and 570 transitions. Second operand has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:55,297 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select .cse2 .cse1) 0) (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484))) (let ((.cse3 (select (select (let ((.cse7 (store .cse5 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse3 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse4 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= .cse3 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|)))))) (= 0 (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:43:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:43:59,453 INFO L93 Difference]: Finished difference Result 800 states and 1052 transitions. [2022-07-20 05:43:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 05:43:59,454 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 05:43:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:43:59,456 INFO L225 Difference]: With dead ends: 800 [2022-07-20 05:43:59,456 INFO L226 Difference]: Without dead ends: 800 [2022-07-20 05:43:59,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=714, Invalid=3465, Unknown=17, NotChecked=1206, Total=5402 [2022-07-20 05:43:59,457 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 1443 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 6087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3486 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:43:59,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 2085 Invalid, 6087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2478 Invalid, 0 Unknown, 3486 Unchecked, 2.7s Time] [2022-07-20 05:43:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-07-20 05:43:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 486. [2022-07-20 05:43:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 441 states have (on average 1.6122448979591837) internal successors, (711), 485 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 711 transitions. [2022-07-20 05:43:59,462 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 711 transitions. Word has length 35 [2022-07-20 05:43:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:43:59,463 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 711 transitions. [2022-07-20 05:43:59,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:43:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 711 transitions. [2022-07-20 05:43:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 05:43:59,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:43:59,463 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, 1, 1] [2022-07-20 05:43:59,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:43:59,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:59,681 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:43:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:43:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1262484393, now seen corresponding path program 1 times [2022-07-20 05:43:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:43:59,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406615069] [2022-07-20 05:43:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:43:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:43:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:43:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:43:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406615069] [2022-07-20 05:43:59,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406615069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:43:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570613485] [2022-07-20 05:43:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:43:59,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:43:59,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:43:59,983 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) [2022-07-20 05:43:59,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:44:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:00,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-20 05:44:00,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:00,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:00,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:00,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:00,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:00,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:00,300 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:00,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:44:00,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:44:00,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:00,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:44:00,579 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:00,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 56 [2022-07-20 05:44:00,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-07-20 05:44:00,674 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:00,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:00,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 48 [2022-07-20 05:44:00,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:01,097 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:01,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 65 [2022-07-20 05:44:01,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 36 [2022-07-20 05:44:01,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-20 05:44:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:01,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:01,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1591) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= .cse0 0))))) is different from false [2022-07-20 05:44:01,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1591) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2022-07-20 05:44:01,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) is different from false [2022-07-20 05:44:01,997 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-07-20 05:44:01,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-20 05:44:02,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|)))) is different from false [2022-07-20 05:44:02,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) is different from false [2022-07-20 05:44:03,068 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:44:03,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:44:03,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587))) (let ((.cse0 (select (select (let ((.cse4 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (and (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))))) is different from false [2022-07-20 05:44:04,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:04,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 75 [2022-07-20 05:44:04,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 298 [2022-07-20 05:44:04,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 262 [2022-07-20 05:44:04,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 133 treesize of output 129 [2022-07-20 05:44:04,249 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-07-20 05:44:04,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 161 treesize of output 99 [2022-07-20 05:44:04,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:04,262 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-20 05:44:04,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 440 treesize of output 256 [2022-07-20 05:44:04,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-20 05:44:04,278 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:44:04,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-07-20 05:44:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:04,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570613485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:04,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:04,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2022-07-20 05:44:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756055147] [2022-07-20 05:44:04,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:04,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 05:44:04,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:04,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 05:44:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1284, Unknown=30, NotChecked=474, Total=1980 [2022-07-20 05:44:04,352 INFO L87 Difference]: Start difference. First operand 486 states and 711 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:04,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587))) (let ((.cse0 (select (select (let ((.cse4 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (and (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))))) (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select .cse5 .cse6) 0) (= |c_ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| 0)) (= (select .cse7 .cse6) 0) (= 0 (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:08,848 INFO L93 Difference]: Finished difference Result 823 states and 1091 transitions. [2022-07-20 05:44:08,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 05:44:08,849 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 05:44:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:08,851 INFO L225 Difference]: With dead ends: 823 [2022-07-20 05:44:08,851 INFO L226 Difference]: Without dead ends: 823 [2022-07-20 05:44:08,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=724, Invalid=3433, Unknown=31, NotChecked=924, Total=5112 [2022-07-20 05:44:08,852 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1356 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 5995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3434 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:08,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 2314 Invalid, 5995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2415 Invalid, 0 Unknown, 3434 Unchecked, 2.7s Time] [2022-07-20 05:44:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-20 05:44:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 458. [2022-07-20 05:44:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 413 states have (on average 1.612590799031477) internal successors, (666), 457 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 666 transitions. [2022-07-20 05:44:08,857 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 666 transitions. Word has length 35 [2022-07-20 05:44:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:08,857 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 666 transitions. [2022-07-20 05:44:08,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 666 transitions. [2022-07-20 05:44:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 05:44:08,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:08,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:44:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:44:09,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:09,068 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:44:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -974847376, now seen corresponding path program 1 times [2022-07-20 05:44:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:09,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464644622] [2022-07-20 05:44:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:09,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464644622] [2022-07-20 05:44:09,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464644622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:44:09,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:44:09,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-20 05:44:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746034766] [2022-07-20 05:44:09,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:44:09,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 05:44:09,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:09,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 05:44:09,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:44:09,472 INFO L87 Difference]: Start difference. First operand 458 states and 666 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:11,583 INFO L93 Difference]: Finished difference Result 798 states and 1070 transitions. [2022-07-20 05:44:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:44:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 05:44:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:11,585 INFO L225 Difference]: With dead ends: 798 [2022-07-20 05:44:11,585 INFO L226 Difference]: Without dead ends: 798 [2022-07-20 05:44:11,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:44:11,586 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 796 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:11,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 786 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-20 05:44:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-07-20 05:44:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 491. [2022-07-20 05:44:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 446 states have (on average 1.6053811659192825) internal successors, (716), 490 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 716 transitions. [2022-07-20 05:44:11,592 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 716 transitions. Word has length 35 [2022-07-20 05:44:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:11,593 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 716 transitions. [2022-07-20 05:44:11,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 716 transitions. [2022-07-20 05:44:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:44:11,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:11,594 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, 1, 1, 1] [2022-07-20 05:44:11,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-20 05:44:11,594 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:44:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038395, now seen corresponding path program 1 times [2022-07-20 05:44:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:11,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088268859] [2022-07-20 05:44:11,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088268859] [2022-07-20 05:44:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088268859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351863464] [2022-07-20 05:44:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:11,936 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) [2022-07-20 05:44:11,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:44:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:12,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 05:44:12,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:12,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:12,174 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:12,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:12,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:44:12,321 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:12,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-07-20 05:44:12,356 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:12,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:12,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-07-20 05:44:12,506 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:12,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-20 05:44:12,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:12,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:12,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-07-20 05:44:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:12,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:13,023 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-20 05:44:13,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:44:13,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_59|)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1710) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8)) |c_ULTIMATE.start_main_#t~mem11#1.base|) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_59| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:13,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_59|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1710) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8)))) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_59| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:13,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_59|)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1709))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1710) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8))))) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_59| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:13,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_32| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_32|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_59|)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1708) |v_ULTIMATE.start_main_~tmpList~0#1.base_32| v_ArrVal_1709))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (= (select (select (store .cse0 .cse1 v_ArrVal_1710) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8)) .cse1))) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_59| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:13,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:13,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 53 [2022-07-20 05:44:13,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:13,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:13,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 498 treesize of output 396 [2022-07-20 05:44:13,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:13,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 326 treesize of output 266 [2022-07-20 05:44:13,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 222 [2022-07-20 05:44:13,416 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:44:13,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:44:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:13,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351863464] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:13,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:13,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 31 [2022-07-20 05:44:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658062925] [2022-07-20 05:44:13,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:13,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 05:44:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 05:44:13,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=668, Unknown=8, NotChecked=220, Total=992 [2022-07-20 05:44:13,704 INFO L87 Difference]: Start difference. First operand 491 states and 716 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:15,417 INFO L93 Difference]: Finished difference Result 657 states and 924 transitions. [2022-07-20 05:44:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:44:15,418 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 05:44:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:15,420 INFO L225 Difference]: With dead ends: 657 [2022-07-20 05:44:15,420 INFO L226 Difference]: Without dead ends: 657 [2022-07-20 05:44:15,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=297, Invalid=1603, Unknown=8, NotChecked=348, Total=2256 [2022-07-20 05:44:15,420 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 366 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1038 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:15,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2095 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 827 Invalid, 0 Unknown, 1038 Unchecked, 0.9s Time] [2022-07-20 05:44:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-07-20 05:44:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 528. [2022-07-20 05:44:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 483 states have (on average 1.5755693581780539) internal successors, (761), 527 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 761 transitions. [2022-07-20 05:44:15,425 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 761 transitions. Word has length 36 [2022-07-20 05:44:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:15,426 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 761 transitions. [2022-07-20 05:44:15,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 761 transitions. [2022-07-20 05:44:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:44:15,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:15,426 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, 1, 1, 1] [2022-07-20 05:44:15,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 05:44:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:15,640 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:44:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038396, now seen corresponding path program 1 times [2022-07-20 05:44:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:15,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070467607] [2022-07-20 05:44:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070467607] [2022-07-20 05:44:16,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070467607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:16,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951826519] [2022-07-20 05:44:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:16,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:16,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:16,071 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) [2022-07-20 05:44:16,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:44:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:16,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 05:44:16,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:16,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:16,279 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:16,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:16,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:44:16,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:44:16,488 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:16,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 36 [2022-07-20 05:44:16,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:44:16,537 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:16,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:16,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:44:16,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 28 [2022-07-20 05:44:16,917 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:16,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-20 05:44:16,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:44:17,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:17,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 05:44:17,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:17,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-20 05:44:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:17,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:17,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_61| Int) (v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1804 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_61|)) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_61| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_61| 8))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1805) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1804) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))))) is different from false [2022-07-20 05:44:18,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:18,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 84 [2022-07-20 05:44:22,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:22,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 [2022-07-20 05:44:22,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:22,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 41 [2022-07-20 05:44:22,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:22,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 54 [2022-07-20 05:44:22,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:22,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:22,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 156 treesize of output 150 [2022-07-20 05:44:22,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 58 [2022-07-20 05:44:22,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 102 [2022-07-20 05:44:22,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 94 [2022-07-20 05:44:22,750 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:44:22,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 1 [2022-07-20 05:44:22,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:22,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 51 [2022-07-20 05:44:22,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:22,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 41 [2022-07-20 05:44:22,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:22,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:22,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 23 [2022-07-20 05:44:22,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:22,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:22,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:22,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:44:22,838 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:44:22,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:44:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:25,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951826519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:25,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:25,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 43 [2022-07-20 05:44:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664037435] [2022-07-20 05:44:25,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:25,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 05:44:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:25,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 05:44:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1622, Unknown=46, NotChecked=82, Total=1892 [2022-07-20 05:44:25,073 INFO L87 Difference]: Start difference. First operand 528 states and 761 transitions. Second operand has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:28,113 INFO L93 Difference]: Finished difference Result 620 states and 872 transitions. [2022-07-20 05:44:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:44:28,113 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 05:44:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:28,116 INFO L225 Difference]: With dead ends: 620 [2022-07-20 05:44:28,116 INFO L226 Difference]: Without dead ends: 620 [2022-07-20 05:44:28,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=442, Invalid=2822, Unknown=46, NotChecked=112, Total=3422 [2022-07-20 05:44:28,117 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 558 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1136 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:28,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 3019 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1622 Invalid, 0 Unknown, 1136 Unchecked, 1.7s Time] [2022-07-20 05:44:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-07-20 05:44:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 532. [2022-07-20 05:44:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 487 states have (on average 1.570841889117043) internal successors, (765), 531 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 765 transitions. [2022-07-20 05:44:28,123 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 765 transitions. Word has length 36 [2022-07-20 05:44:28,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:28,123 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 765 transitions. [2022-07-20 05:44:28,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 765 transitions. [2022-07-20 05:44:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:44:28,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:28,124 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, 1, 1, 1, 1] [2022-07-20 05:44:28,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:44:28,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:28,333 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:44:28,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:28,334 INFO L85 PathProgramCache]: Analyzing trace with hash -751292082, now seen corresponding path program 1 times [2022-07-20 05:44:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:28,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077731987] [2022-07-20 05:44:28,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:28,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077731987] [2022-07-20 05:44:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077731987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147125242] [2022-07-20 05:44:28,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:28,734 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) [2022-07-20 05:44:28,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:44:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:28,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 05:44:28,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:28,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:28,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:44:28,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:44:28,976 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:28,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:29,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:29,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-20 05:44:29,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:29,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:29,183 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:29,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-20 05:44:29,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:44:29,242 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:44:29,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:44:29,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:44:29,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2022-07-20 05:44:29,443 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:29,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-20 05:44:29,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:44:29,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:44:29,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:29,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 11 [2022-07-20 05:44:29,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:29,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:29,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 10 [2022-07-20 05:44:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:29,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:30,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_64| Int) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (or (let ((.cse0 (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_64| 4))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1903) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 0))) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_64|)) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_64| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:30,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_64| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_64|)) (and (forall ((v_ArrVal_1904 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1904) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_64| 4)) 0)) (forall ((v_ArrVal_1903 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1903) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_64| 4)) 0))) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_64| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:30,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_36| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_64| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_64|)) (and (forall ((v_ArrVal_1901 (Array Int Int)) (v_ArrVal_1904 (Array Int Int)) (v_ArrVal_1902 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1899) |v_ULTIMATE.start_main_~tmpList~0#1.base_36| v_ArrVal_1901) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1900) |v_ULTIMATE.start_main_~tmpList~0#1.base_36| v_ArrVal_1902) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1904) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_64| 4)))) (forall ((v_ArrVal_1903 (Array Int Int)) (v_ArrVal_1902 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1900) |v_ULTIMATE.start_main_~tmpList~0#1.base_36| v_ArrVal_1902))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1903)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_64| 4)) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_36|) 0)) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_64| |c_ULTIMATE.start_main_~tree~0#1.offset|)))) is different from false [2022-07-20 05:44:31,140 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:44:31,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:44:41,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:41,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:41,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 66 [2022-07-20 05:44:41,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:41,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:41,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 51 [2022-07-20 05:44:41,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:41,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:41,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2022-07-20 05:44:41,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:41,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:41,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 304 treesize of output 286 [2022-07-20 05:44:41,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 254 [2022-07-20 05:44:41,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 222 [2022-07-20 05:44:41,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 98 [2022-07-20 05:44:41,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:44:41,972 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-20 05:44:41,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2022-07-20 05:44:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:44,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147125242] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:44:44,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:44:44,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 38 [2022-07-20 05:44:44,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79525158] [2022-07-20 05:44:44,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:44:44,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 05:44:44,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 05:44:44,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1006, Unknown=28, NotChecked=204, Total=1406 [2022-07-20 05:44:44,094 INFO L87 Difference]: Start difference. First operand 532 states and 765 transitions. Second operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:46,246 INFO L93 Difference]: Finished difference Result 713 states and 984 transitions. [2022-07-20 05:44:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:44:46,247 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 05:44:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:46,248 INFO L225 Difference]: With dead ends: 713 [2022-07-20 05:44:46,248 INFO L226 Difference]: Without dead ends: 713 [2022-07-20 05:44:46,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=359, Invalid=1787, Unknown=28, NotChecked=276, Total=2450 [2022-07-20 05:44:46,249 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 332 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1521 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:46,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 2342 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 752 Invalid, 0 Unknown, 1521 Unchecked, 1.2s Time] [2022-07-20 05:44:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-07-20 05:44:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 532. [2022-07-20 05:44:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 487 states have (on average 1.568788501026694) internal successors, (764), 531 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2022-07-20 05:44:46,254 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 764 transitions. Word has length 37 [2022-07-20 05:44:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:46,254 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 764 transitions. [2022-07-20 05:44:46,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 764 transitions. [2022-07-20 05:44:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:44:46,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:46,255 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, 1, 1, 1, 1] [2022-07-20 05:44:46,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:44:46,458 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,SelfDestructingSolverStorable45 [2022-07-20 05:44:46,459 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:44:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -525450377, now seen corresponding path program 1 times [2022-07-20 05:44:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:46,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119812900] [2022-07-20 05:44:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:46,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119812900] [2022-07-20 05:44:46,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119812900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:44:46,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:44:46,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:44:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994782917] [2022-07-20 05:44:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:44:46,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:44:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:44:46,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:44:46,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:44:46,497 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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) [2022-07-20 05:44:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:44:46,529 INFO L93 Difference]: Finished difference Result 524 states and 713 transitions. [2022-07-20 05:44:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:44:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 [2022-07-20 05:44:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:44:46,531 INFO L225 Difference]: With dead ends: 524 [2022-07-20 05:44:46,531 INFO L226 Difference]: Without dead ends: 524 [2022-07-20 05:44:46,531 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 [2022-07-20 05:44:46,532 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 33 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:44:46,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 313 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:44:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-20 05:44:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 505. [2022-07-20 05:44:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 460 states have (on average 1.55) internal successors, (713), 504 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:44:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 713 transitions. [2022-07-20 05:44:46,536 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 713 transitions. Word has length 37 [2022-07-20 05:44:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:44:46,536 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 713 transitions. [2022-07-20 05:44:46,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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) [2022-07-20 05:44:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 713 transitions. [2022-07-20 05:44:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:44:46,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:44:46,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:44:46,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-20 05:44:46,536 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:44:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:44:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash 890909625, now seen corresponding path program 1 times [2022-07-20 05:44:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:44:46,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297530984] [2022-07-20 05:44:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:44:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:44:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297530984] [2022-07-20 05:44:47,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297530984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:44:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365743615] [2022-07-20 05:44:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:44:47,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:44:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:44:47,730 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) [2022-07-20 05:44:47,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:44:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:44:47,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 05:44:47,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:44:48,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:44:48,319 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:44:48,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 37 [2022-07-20 05:44:48,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:48,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-07-20 05:44:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:44:49,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:44:50,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1999 (Array Int Int)) (|ULTIMATE.start_main_~tmp~0#1.offset| Int)) (or (not (<= |ULTIMATE.start_main_~tmp~0#1.offset| 0)) (not (<= 0 |ULTIMATE.start_main_~tmp~0#1.offset|)) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1999) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |ULTIMATE.start_main_~tmp~0#1.offset| 8)) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 05:44:50,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1999 (Array Int Int)) (|ULTIMATE.start_main_~tmp~0#1.offset| Int)) (or (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_1999) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |ULTIMATE.start_main_~tmp~0#1.offset| 8)) 0) |c_ULTIMATE.start_main_~tree~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_main_~tmp~0#1.offset| 0)) (not (<= 0 |ULTIMATE.start_main_~tmp~0#1.offset|)))) is different from false [2022-07-20 05:44:50,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:50,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-07-20 05:44:50,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:44:50,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 56 [2022-07-20 05:44:50,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 17 [2022-07-20 05:45:36,629 WARN L233 SmtUtils]: Spent 26.55s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:45:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:37,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365743615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:45:37,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:45:37,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 40 [2022-07-20 05:45:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564580552] [2022-07-20 05:45:37,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:45:37,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-20 05:45:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:45:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-20 05:45:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=8, NotChecked=150, Total=1640 [2022-07-20 05:45:37,190 INFO L87 Difference]: Start difference. First operand 505 states and 713 transitions. Second operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:45:41,691 INFO L93 Difference]: Finished difference Result 529 states and 737 transitions. [2022-07-20 05:45:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:45:41,692 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.7) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 05:45:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:45:41,693 INFO L225 Difference]: With dead ends: 529 [2022-07-20 05:45:41,693 INFO L226 Difference]: Without dead ends: 507 [2022-07-20 05:45:41,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=239, Invalid=2623, Unknown=8, NotChecked=210, Total=3080 [2022-07-20 05:45:41,694 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 27 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:45:41,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2037 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1370 Invalid, 0 Unknown, 600 Unchecked, 2.4s Time] [2022-07-20 05:45:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-07-20 05:45:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2022-07-20 05:45:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 462 states have (on average 1.5476190476190477) internal successors, (715), 506 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 715 transitions. [2022-07-20 05:45:41,699 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 715 transitions. Word has length 38 [2022-07-20 05:45:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:45:41,699 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 715 transitions. [2022-07-20 05:45:41,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.7) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 715 transitions. [2022-07-20 05:45:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:45:41,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:45:41,699 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, 1, 1, 1, 1, 1, 1] [2022-07-20 05:45:41,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:45:41,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-20 05:45:41,917 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:45:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:45:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1603274722, now seen corresponding path program 1 times [2022-07-20 05:45:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:45:41,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356782358] [2022-07-20 05:45:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:45:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:45:42,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356782358] [2022-07-20 05:45:42,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356782358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:45:42,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984767118] [2022-07-20 05:45:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:42,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:45:42,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:45:42,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:45:42,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:45:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:42,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 05:45:42,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:45:42,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:42,596 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:45:42,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:42,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:45:42,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:45:42,807 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:45:42,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 36 [2022-07-20 05:45:42,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:45:42,861 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:45:42,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:42,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:45:42,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-07-20 05:45:43,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-20 05:45:43,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:45:43,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:43,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:43,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 10 [2022-07-20 05:45:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:43,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:45:43,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_68| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)))) is different from false [2022-07-20 05:45:43,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_68| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0))) is different from false [2022-07-20 05:45:43,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_68| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2093) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2094) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0))) is different from false [2022-07-20 05:45:44,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_39| Int) (v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|) 0)) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_68| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2091) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2093) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2092) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2094) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_68|)))) is different from false [2022-07-20 05:45:44,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:44,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 [2022-07-20 05:45:44,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:44,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 41 [2022-07-20 05:45:44,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:44,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 54 [2022-07-20 05:45:44,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:44,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:44,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 156 treesize of output 150 [2022-07-20 05:45:44,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 58 [2022-07-20 05:45:44,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 102 [2022-07-20 05:45:44,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 94 [2022-07-20 05:45:44,208 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:45:44,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:45:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:44,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984767118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:45:44,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:45:44,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2022-07-20 05:45:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638226501] [2022-07-20 05:45:44,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:45:44,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:45:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:45:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:45:44,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=704, Unknown=8, NotChecked=228, Total=1056 [2022-07-20 05:45:44,462 INFO L87 Difference]: Start difference. First operand 507 states and 715 transitions. Second operand has 33 states, 32 states have (on average 3.1875) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:45:46,531 INFO L93 Difference]: Finished difference Result 643 states and 886 transitions. [2022-07-20 05:45:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:45:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.1875) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 05:45:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:45:46,533 INFO L225 Difference]: With dead ends: 643 [2022-07-20 05:45:46,533 INFO L226 Difference]: Without dead ends: 643 [2022-07-20 05:45:46,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=314, Invalid=1416, Unknown=8, NotChecked=332, Total=2070 [2022-07-20 05:45:46,533 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 264 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 862 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:45:46,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1935 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 851 Invalid, 0 Unknown, 862 Unchecked, 1.2s Time] [2022-07-20 05:45:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-07-20 05:45:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 510. [2022-07-20 05:45:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 465 states have (on average 1.5462365591397849) internal successors, (719), 509 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 719 transitions. [2022-07-20 05:45:46,538 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 719 transitions. Word has length 39 [2022-07-20 05:45:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:45:46,538 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 719 transitions. [2022-07-20 05:45:46,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.1875) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 719 transitions. [2022-07-20 05:45:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:45:46,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:45:46,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:45:46,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:45:46,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-20 05:45:46,747 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:45:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:45:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1069717192, now seen corresponding path program 1 times [2022-07-20 05:45:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:45:46,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803679592] [2022-07-20 05:45:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:45:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:45:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803679592] [2022-07-20 05:45:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803679592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:45:47,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:45:47,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 05:45:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729496342] [2022-07-20 05:45:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:45:47,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:45:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:45:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:45:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:45:47,267 INFO L87 Difference]: Start difference. First operand 510 states and 719 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:45:49,800 INFO L93 Difference]: Finished difference Result 884 states and 1205 transitions. [2022-07-20 05:45:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:45:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 05:45:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:45:49,809 INFO L225 Difference]: With dead ends: 884 [2022-07-20 05:45:49,809 INFO L226 Difference]: Without dead ends: 884 [2022-07-20 05:45:49,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:45:49,814 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1004 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:45:49,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1259 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 05:45:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-07-20 05:45:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 562. [2022-07-20 05:45:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 517 states have (on average 1.539651837524178) internal successors, (796), 561 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 796 transitions. [2022-07-20 05:45:49,820 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 796 transitions. Word has length 39 [2022-07-20 05:45:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:45:49,820 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 796 transitions. [2022-07-20 05:45:49,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 796 transitions. [2022-07-20 05:45:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:45:49,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:45:49,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:45:49,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-20 05:45:49,821 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:45:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:45:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1069717193, now seen corresponding path program 1 times [2022-07-20 05:45:49,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:45:49,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663860692] [2022-07-20 05:45:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:45:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:45:50,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663860692] [2022-07-20 05:45:50,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663860692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:45:50,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:45:50,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 05:45:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936365143] [2022-07-20 05:45:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:45:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:45:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:45:50,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:45:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:45:50,513 INFO L87 Difference]: Start difference. First operand 562 states and 796 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:45:53,493 INFO L93 Difference]: Finished difference Result 884 states and 1205 transitions. [2022-07-20 05:45:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:45:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 05:45:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:45:53,495 INFO L225 Difference]: With dead ends: 884 [2022-07-20 05:45:53,495 INFO L226 Difference]: Without dead ends: 884 [2022-07-20 05:45:53,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:45:53,495 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 879 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:45:53,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1126 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-20 05:45:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-07-20 05:45:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 562. [2022-07-20 05:45:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 517 states have (on average 1.5377176015473888) internal successors, (795), 561 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 795 transitions. [2022-07-20 05:45:53,500 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 795 transitions. Word has length 39 [2022-07-20 05:45:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:45:53,501 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 795 transitions. [2022-07-20 05:45:53,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:45:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 795 transitions. [2022-07-20 05:45:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 05:45:53,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:45:53,502 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:45:53,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-20 05:45:53,502 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:45:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:45:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1838090824, now seen corresponding path program 1 times [2022-07-20 05:45:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:45:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198387381] [2022-07-20 05:45:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:45:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:45:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198387381] [2022-07-20 05:45:54,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198387381] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:45:54,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525232262] [2022-07-20 05:45:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:45:54,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:45:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:45:54,326 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:45:54,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:45:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:45:54,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:45:54,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:45:54,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:54,579 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:45:54,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:54,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:45:54,911 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:45:54,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-07-20 05:45:54,979 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:45:54,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:55,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2022-07-20 05:45:55,387 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:45:55,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-07-20 05:45:55,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:55,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:55,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 14 [2022-07-20 05:45:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:55,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:45:56,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_70| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_70|)))) is different from false [2022-07-20 05:45:56,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_70| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2313) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_70|)))) is different from false [2022-07-20 05:45:56,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2312 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_70| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2313)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_70|)))) is different from false [2022-07-20 05:45:56,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_41| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_41|) 0)) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_70| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (< (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2311) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_2312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)) v_ArrVal_2313)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_70|)))) is different from false [2022-07-20 05:45:56,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:56,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:45:56,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:45:56,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:56,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 278 treesize of output 236 [2022-07-20 05:45:56,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:45:56,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 146 [2022-07-20 05:45:57,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 118 [2022-07-20 05:45:57,020 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:45:57,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:45:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:45:57,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525232262] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:45:57,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:45:57,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 13] total 38 [2022-07-20 05:45:57,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732163222] [2022-07-20 05:45:57,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:45:57,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 05:45:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:45:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 05:45:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1003, Unknown=14, NotChecked=268, Total=1406 [2022-07-20 05:45:57,421 INFO L87 Difference]: Start difference. First operand 562 states and 795 transitions. Second operand has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:46:01,974 INFO L93 Difference]: Finished difference Result 814 states and 1091 transitions. [2022-07-20 05:46:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 05:46:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 05:46:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:46:01,976 INFO L225 Difference]: With dead ends: 814 [2022-07-20 05:46:01,976 INFO L226 Difference]: Without dead ends: 812 [2022-07-20 05:46:01,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=399, Invalid=3143, Unknown=14, NotChecked=476, Total=4032 [2022-07-20 05:46:01,977 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 483 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1660 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:46:01,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 3029 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1567 Invalid, 0 Unknown, 1660 Unchecked, 2.5s Time] [2022-07-20 05:46:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-20 05:46:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 563. [2022-07-20 05:46:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 518 states have (on average 1.5366795366795367) internal successors, (796), 562 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 796 transitions. [2022-07-20 05:46:01,982 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 796 transitions. Word has length 40 [2022-07-20 05:46:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:46:01,982 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 796 transitions. [2022-07-20 05:46:01,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 796 transitions. [2022-07-20 05:46:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 05:46:01,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:46:01,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:46:02,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:46:02,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-07-20 05:46:02,183 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:46:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:46:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1495622602, now seen corresponding path program 1 times [2022-07-20 05:46:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:46:02,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293386859] [2022-07-20 05:46:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:46:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:46:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:46:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:46:02,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293386859] [2022-07-20 05:46:02,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293386859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:46:02,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870529166] [2022-07-20 05:46:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:46:02,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:46:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:46:02,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:46:02,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:46:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:46:02,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:46:02,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:46:02,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:46:02,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:46:02,761 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:46:02,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:02,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:46:02,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:46:02,840 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:46:02,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:02,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:46:03,329 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:46:03,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:46:04,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 [2022-07-20 05:46:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870529166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:46:04,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:46:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2022-07-20 05:46:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858709239] [2022-07-20 05:46:04,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:46:04,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:46:04,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:46:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:46:04,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:46:04,853 INFO L87 Difference]: Start difference. First operand 563 states and 796 transitions. Second operand has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:46:06,644 INFO L93 Difference]: Finished difference Result 722 states and 917 transitions. [2022-07-20 05:46:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:46:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 05:46:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:46:06,645 INFO L225 Difference]: With dead ends: 722 [2022-07-20 05:46:06,645 INFO L226 Difference]: Without dead ends: 722 [2022-07-20 05:46:06,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:46:06,646 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1330 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:46:06,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 482 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 761 Invalid, 0 Unknown, 314 Unchecked, 1.3s Time] [2022-07-20 05:46:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-07-20 05:46:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 448. [2022-07-20 05:46:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 411 states have (on average 1.4014598540145986) internal successors, (576), 447 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 576 transitions. [2022-07-20 05:46:06,650 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 576 transitions. Word has length 41 [2022-07-20 05:46:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:46:06,650 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 576 transitions. [2022-07-20 05:46:06,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 576 transitions. [2022-07-20 05:46:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:46:06,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:46:06,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:46:06,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:46:06,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:46:06,852 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:46:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:46:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1141295518, now seen corresponding path program 1 times [2022-07-20 05:46:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:46:06,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521171351] [2022-07-20 05:46:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:46:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:46:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:46:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:46:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521171351] [2022-07-20 05:46:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521171351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:46:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765519083] [2022-07-20 05:46:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:46:07,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:46:07,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:46:07,894 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:46:07,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:46:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:46:08,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-20 05:46:08,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:46:08,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:08,130 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:46:08,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:08,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:46:08,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:46:08,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-07-20 05:46:08,361 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:46:08,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:08,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-07-20 05:46:08,576 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-07-20 05:46:08,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 36 [2022-07-20 05:46:08,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 54 [2022-07-20 05:46:09,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:09,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2022-07-20 05:46:09,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:09,290 INFO L356 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-07-20 05:46:09,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 26 [2022-07-20 05:46:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:09,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:46:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765519083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:46:09,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:46:09,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 29 [2022-07-20 05:46:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30696070] [2022-07-20 05:46:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:46:09,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:46:09,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:46:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:46:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:46:09,441 INFO L87 Difference]: Start difference. First operand 448 states and 576 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:46:10,055 INFO L93 Difference]: Finished difference Result 457 states and 586 transitions. [2022-07-20 05:46:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:46:10,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 05:46:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:46:10,057 INFO L225 Difference]: With dead ends: 457 [2022-07-20 05:46:10,057 INFO L226 Difference]: Without dead ends: 457 [2022-07-20 05:46:10,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:46:10,071 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 171 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:46:10,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 869 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 333 Invalid, 0 Unknown, 290 Unchecked, 0.4s Time] [2022-07-20 05:46:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-07-20 05:46:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 453. [2022-07-20 05:46:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 416 states have (on average 1.3990384615384615) internal successors, (582), 452 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 582 transitions. [2022-07-20 05:46:10,092 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 582 transitions. Word has length 42 [2022-07-20 05:46:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:46:10,092 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 582 transitions. [2022-07-20 05:46:10,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:46:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 582 transitions. [2022-07-20 05:46:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:46:10,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:46:10,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:46:10,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:46:10,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-07-20 05:46:10,300 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-07-20 05:46:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:46:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1141295517, now seen corresponding path program 1 times [2022-07-20 05:46:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:46:10,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238579521] [2022-07-20 05:46:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:46:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:46:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:46:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:46:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238579521] [2022-07-20 05:46:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238579521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:46:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790864843] [2022-07-20 05:46:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:46:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:46:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:46:11,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:46:11,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:46:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:46:11,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-20 05:46:11,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:46:11,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:11,422 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:46:11,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:11,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:46:11,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:46:11,736 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:46:11,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 36 [2022-07-20 05:46:11,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:46:11,806 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:46:11,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 05:46:11,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-07-20 05:46:11,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:46:12,265 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-07-20 05:46:12,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 47 [2022-07-20 05:46:12,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 80 treesize of output 58 [2022-07-20 05:46:13,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:13,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:13,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:46:13,193 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:46:13,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 46 [2022-07-20 05:46:13,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:13,208 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:46:13,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2022-07-20 05:46:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:46:13,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:46:25,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:46:25,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 437 treesize of output 441 [2022-07-20 05:46:25,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2625 (Array Int Int)) (v_ArrVal_2624 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_75| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2624)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2625)) (.cse10 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |c_ULTIMATE.start_main_~tmpList~0#1.offset|))) (.cse5 (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_75| 8))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_75| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_75|)) (let ((.cse0 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |c_ULTIMATE.start_main_~tmpList~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (and (= |c_ULTIMATE.start_main_~tmpList~0#1.base| (select (select .cse0 .cse1) .cse2)) (<= 0 .cse3) (<= .cse3 |c_ULTIMATE.start_main_~tmpList~0#1.offset|))))) (< .cse2 0))))))) is different from false [2022-07-20 05:46:29,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2625 (Array Int Int)) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 (Array Int Int)) (v_ArrVal_2622 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_75| Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2622) |v_ULTIMATE.start_main_~tmpList~0#1.base_45| v_ArrVal_2624)) (.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2623) |v_ULTIMATE.start_main_~tmpList~0#1.base_45| v_ArrVal_2625)) (.cse10 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 0))) (.cse5 (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_75| 8))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (or (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_75| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_~tmpList~0#1.base_45|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (and (<= .cse0 0) (= (select (select .cse1 .cse2) .cse3) |v_ULTIMATE.start_main_~tmpList~0#1.base_45|) (<= 0 .cse0))))) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_75|)) (< .cse3 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_45|) 0)))))))) is different from false [2022-07-20 05:46:32,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2625 (Array Int Int)) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 (Array Int Int)) (v_ArrVal_2622 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_75| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_2622) |v_ULTIMATE.start_main_~tmpList~0#1.base_45| v_ArrVal_2624)) (.cse6 (store (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_2623) |v_ULTIMATE.start_main_~tmpList~0#1.base_45| v_ArrVal_2625))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 0))) (.cse5 (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_75| 8))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (or (< .cse0 0) (not (<= |v_ULTIMATE.start_main_~tmp~0#1.offset_75| |c_ULTIMATE.start_main_~tree~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_75|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_45|) 0)) (let ((.cse1 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_ULTIMATE.start_main_~tmpList~0#1.base_45|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse3 (select (select .cse4 .cse2) .cse0))) (and (= (select (select .cse1 .cse2) .cse0) |v_ULTIMATE.start_main_~tmpList~0#1.base_45|) (<= .cse3 0) (<= 0 .cse3))))))))))))) is different from false [2022-07-20 05:46:33,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:46:33,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1128 treesize of output 918 [2022-07-20 05:46:33,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:46:33,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 908 treesize of output 638 [2022-07-20 05:46:33,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:34,144 INFO L356 Elim1Store]: treesize reduction 167, result has 74.6 percent of original size [2022-07-20 05:46:34,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 209843 treesize of output 194828 [2022-07-20 05:46:34,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:46:34,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:46:41,275 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 306 DAG size of output: 206 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-20 05:46:41,276 INFO L356 Elim1Store]: treesize reduction 452, result has 60.5 percent of original size [2022-07-20 05:46:41,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 66 case distinctions, treesize of input 4701552 treesize of output 4309060 [2022-07-20 05:46:51,168 WARN L233 SmtUtils]: Spent 9.87s on a formula simplification that was a NOOP. DAG size: 11718 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-20 05:47:00,867 WARN L233 SmtUtils]: Spent 9.67s on a formula simplification that was a NOOP. DAG size: 11691 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-20 05:47:01,942 INFO L244 Elim1Store]: Index analysis took 189 ms [2022-07-20 05:47:05,126 INFO L356 Elim1Store]: treesize reduction 397, result has 55.7 percent of original size [2022-07-20 05:47:05,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 5359476 treesize of output 4914167